Efficiently evaluating complex boolean expressions

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 2010, Pages 3-14

  Fontoura, Marcus ^a   Sadanandan, Suhas ^a   Shanmugasundaram, Jayavel ^a   Vassilvitski, Sergei ^a   Vee, Erik ^a   Venkatesan, Srihari ^a   Zien, Jason ^a  

^a YAHOO RESEARCH   (United States)

Author keywords

boolean expressions; dewey; interval; pub sub

Indexed keywords

BLOW-UP; BOOLEAN EXPRESSIONS; EXISTING METHOD; EXPERIMENTAL EVALUATION; NORMAL FORM; NOVEL METHODS; ONLINE ADVERTISING; PUB/SUB; SPACE USAGE;

EID: 77954808652     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1807167.1807171     Document Type: Conference Paper

References (21)

1. G. Ashayer, H. K. Y. Leung, and H.-A. Jacobsen. Predicate matching and subscription matching in publish/subscribe systems. In ICDCSW '02, pages 539-548, Washington, DC, USA, 2002. IEEE Computer Society.
2. M. Ault, D. Liu, and M. Tumma. Oracle Database 10g New Features: Oracle 10g Reference for Advanced Tuning and Administration. Rampant TechPress, 2003.
3. S. Bittner and A. Hinze. The arbitrary boolean publish/subscribe model: making the case. In DEBS'07, pages 226-237, Toronto, Ontario, Canada, 2007. ACM.
4. A. Z. Broder, D. Carmel, M. Herscovici, A. Soffer, and J. Zien. Efficient query evaluation using a two-level retrieval process. In CIKM '03, pages 426-434, New York, NY, USA, 2003. ACM.
5. A. Carzaniga and A. L. Wolf. Forwarding in a content-based network. In SIGCOMM'03, pages 163-174, Karlsruhe, Germany, 2003. ACM.
6. C. Y. Chan, M. N. Garofalakis, and R. Rastogi. Re-tree: an efficient index structure for regular expressions. VLDB Journal, 12(2):102-119, 2003.
7. J. Cho and S. Rajagopalan. A fast regular expression indexing engine. In ICDE'02, pages 419-430, San Jose, CA, USA, 2002. IEEE Computer Society.
8. P. T. Eugster, P. A. Felber, R. Guerraoui, and A.-M. Kermarrec. The many faces of publish/subscribe. ACM Computing Surveys, 35(2):114-131, 2003.
9. F. Fabret, H. A. Jacobsen, F. Llirbat, J. Pereira, K. A. Ross, and D. Shasha. Filtering algorithms and implementation for very fast publish/subscribe systems. In SIGMOD '01, pages 115-126, New York, NY, USA, 2001. ACM.
10. Google Advertising. http://www.google.com/ads/.
11. E. N. Hanson, C. Carnes, L. Huang, M. Konyala, L. Noronha, S. Parthasarathy, J. B. Park, and A. Vernon. Scalable trigger processing. In ICDE'99, pages 266-275, Sydney, Austrialia, 1999. IEEE Computer Society.
12. A. Kemper, G. Moerkotte, and M. Steinbrunn. Optimizing boolean expressions in object-bases. In VLDB'92, pages 79-90, San Francisco, CA, USA, 1992. Morgan Kaufmann Publishers Inc.
13. Microsoft Advertising. http://advertising.microsoft.com/.
14. J. Pereira, F. Fabret, F. Llirbat, and D. Shasha. Efficient matching for web-based publish/subscribe systems. In CooplS '02, pages 162-173, London, UK, 2000. Springer-Verlag.
15. K. A. Ross. Selection conditions in main memory. ACM TODS, 29:132-161, 2004.
16. I. Tatarinov, S. D. Viglas, K. Beyer, J. Shanmugasundaram, E. Shekita, and C. Zhang. Storing and querying ordered xml using a relational database system. In SIGMOD'02, pages 204-215, Madison, Wisconsin, 2002. ACM.
17. S. Whang, C. Brower, J. Shanmugasundaram, S. Vassilvitskii, E. Vee, R. Yerneni, and H. Garcia-Molina. Indexing boolean expressions. PVLDB, 2(1):37-48, August 2009.
18. Yahoo Advertising. http://advertising.yahoo.com/.
19. A. Yalamanchi, J. Srinivasan, and D. Gawlick. Managing expressions as data in relational database systems. In CIDR, Asilomar, CA, USA, 2003.
20. T. Yan and H. Garcia-Molina. Index structures for selective dissemination of information under the boolean model. ACM TODS, 19(2):332-364, 1994.
21. T. Yan and H. Garcia-Molina. The sift information dissemination system. ACM TODS, 24(4):529-565, 1999.