, Matching events in a content-based subscription system, Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing , PODC '99, pp.53-61, 1999.
DOI : 10.1145/301308.301326
, Hourly analysis of a very large topically categorized web query log, Proceedings of the 27th annual international conference on Research and development in information retrieval , SIGIR '04, pp.321-328, 2004.
DOI : 10.1145/1008992.1009048
, Surprising Results of Trie-based FIM Algorithms, FIMI -ICDM Workshop, 2004.
, A trie-based APRIORI implementation for mining frequent item sequences, Proceedings of the 1st international workshop on open source data mining frequent pattern mining implementations, OSDM '05, pp.56-65, 2005.
DOI : 10.1145/1133905.1133913
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.87.2654
, Forwarding in a content-based network, Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications , SIGCOMM '03, pp.163-174, 2003.
DOI : 10.1145/863955.863975
, Dynamical sources in information theory: A general analysis of trie structures, Algorithmica, vol.11, issue.4, pp.307-369, 2001.
DOI : 10.1007/BF02679623
, Filtering Algorithms and Implementation for Very Fast Publish/Subscribe, SIGMOD, pp.115-126, 2001.
DOI : 10.1145/376284.375677
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.22.55
, Characterizing Web Syndication Behavior and Content, pp.29-42, 2011.
DOI : 10.1002/asi.20334
URL : https://hal.archives-ouvertes.fr/hal-00737239
, Efficient query subscription processing for prospective search engines, Proceedings of the 15th international conference on World Wide Web , WWW '06, pp.375-380, 2006.
DOI : 10.1145/1135777.1136003
URL : http://cis.poly.edu/suel/papers/subscribe.pdf
, Analysis and Algorithms for Content-Based Event Matching, 25th IEEE International Conference on Distributed Computing Systems Workshops, pp.363-369, 2005.
DOI : 10.1109/ICDCSW.2005.40
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.137.456
, The Art of Computer Programming, Volume III: Sorting and Searching, 1973.
, A Data Structure for Sponsored Search, 2009 IEEE 25th International Conference on Data Engineering, pp.90-101, 2009.
DOI : 10.1109/ICDE.2009.37
, Scalable ranked publish/subscribe, Proceedings of the VLDB Endowment, vol.1, issue.1, pp.451-462, 2008.
DOI : 10.14778/1453856.1453906
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.140.8311
, Optimizing Frequency Queries for Data Mining Applications, Seventh IEEE International Conference on Data Mining (ICDM 2007), pp.595-600, 2007.
DOI : 10.1109/ICDM.2007.34
, Ideal hash trees, EPFL Swtzerland, 2000.
, On the statistical properties of web search queries, 2010.
, An Efficient Method for Generating Discrete Random Variables with General Distributions, ACM Transactions on Mathematical Software, vol.3, issue.3, pp.253-256, 1977.
DOI : 10.1145/355744.355749
, UB-Tree Based Efficient Predicate Index with Dimension Transform for Pub/Sub System, DASFAA, pp.63-74, 2004.
DOI : 10.1007/978-3-540-24571-1_5
, Index structures for selective dissemination of information under the Boolean model, ACM Transactions on Database Systems, vol.19, issue.2, pp.332-364, 1994.
DOI : 10.1145/176567.176573
, The SIFT information dissemination system, ACM Transactions on Database Systems, vol.24, issue.4, pp.529-565, 1999.
DOI : 10.1145/331983.331992
, Inverted files for text search engines, ACM Computing Surveys, vol.38, issue.2, 2006.
DOI : 10.1145/1132956.1132959