Scalable ranked publish/subscribe

Proceedings of the VLDB Endowment

Volumn 1, Issue 1, 2008, Pages 451-462

  Machanavajjhala, Ashwin ^a   Vee, Erik ^b   Garofalakis, Minos ^b   Shanmugasundaram, Jayavel ^b  

^a Department of Molecular Biology and Genetics   (United States)

^b YAHOO RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMMERCE; MARKETING; WAGES;

EXPERIMENTAL EVALUATION; INDEX STRUCTURE; PERFORMANCE DEGRADATION; PUB/SUB SYSTEMS; PUBLISH/SUBSCRIBE; SPACE OVERHEAD; STOCK QUOTES; WEB ADVERTISING;

COMPENSATION (PERSONNEL);

EID: 77952612384     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/1453856.1453906     Document Type: Article

References (28)

1. AOL Audience Targeting. www.aolmedianetworks.com/index.php?id=1936
2. R. Agrawal, E. Wimmers. A Framework for Expressing and Combining Preferences. SIGMOD 2000.
3. G. Banavar, T. Chandra, B. Mukherjee, J. Nagarajarao. An Efficient Multicast Protocol for Content-Based Publish-Subscribe Systems. ICDCS 1999.
4. B. Becker, S. Gschwind, T. Ohler, B. Seeger, P. Widmayer. An Asymptotically Optimal Multiversion B-Tree. The VLDB Journal 5(4), 1996.
5. W. Bialynicka-Birula, R. Grossi. Rank-Sensitive Data Structures. SPIRE 2005.
6. A. Carzaniga, A. L. Wolf. Forwarding in a Content-Based Network. SIGCOMM 2003.
7. K. Chakrabarti, M. Garofalakis, R. Rastogi, K. Shim Approximate Query Processing Using Wavelets VLDB 2000.
8. J. Chomicki. Querying with Intrinsic Preferences. EDBT 2002.
9. K. L. Clarkson. A Randomized Algorithm for Closest Point Queries. SIAM Journal of Computing 17(4), 1988.
10. T.H. Cormen, C.E. Leiserson, R.L. Rivest. Introduction to Algorithms. MIT Press, 1990.
11. DoubleClick Targeting Filters. www2.doubleclick.com/dk/advertisers/brand/filters.htm
12. M. de Berg, M. van Kreveld, M. Overmars, O. Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer-Verlag, Heidelberg, 2000.
13. Y. Diao, M. Altinel, M. J. Franklin, H. Zhang, P. Fischer. Path Sharing and Predicate Evaluation for High-Performance XML Filtering. TODS 28(4), 2003.
14. Y. Diao, S. Rizvi, M. J. Franklin. Towards an Internet-Scale XML Dissemination Service. VLDB 2004.
15. F. Fabret, H. A. Jacobsen, F. Llirbat, J. Pereira, K. A. Ross, D. Shasha. Filtering Algorithms and Implementation for Very Fast Publish/Subscribe. SIGMOD 2001.
16. M. Jurgens, H. J. Lenz. The Ra*-tree: An Improved R-tree with Materialized Data for Supporting Range Queries on OLAP-Data. DEXA Workshop, 1998.
17. R. Fagin, A. Lotem, M. Naor. Optimal Aggregation Algorithms for Middleware. J. Comput. Syst. Sci. 66(4), 2003.
18. A. Guttman. R-Trees: A Dynamic Index Structure for Spatial Searching. SIGMOD 1984.
19. D. Kukulenz, A. Ntoulas. Answering Bounded Continuous Search Queries in the World Wide Web. WWW 2007.
20. C. Li, K. C. Chang, I. Ilyas, S. Song. RankSQL: query algebra and optimization for relational top-k queries. SIGMOD 2005.
21. Z. Liu, S. Parthasarthy, A. Ranganathan, H. Yang. Scalable Event Matching for Overlapping Subscriptions in Pub/Sub Systems. DEBS 2007.
22. H. Liu, H.A. Jacobsen. Modeling Uncertainties in Publish/Subscribe Systems. ICDE 2003.
23. F. P. Preparata, M. I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, 1985.
24. N. Roussopoulos, S. Kelley, F. Vincent. Nearest Neighbor Queries. SIGMOD 1995.
25. A. C. Snoeren, K. Conley, D. K. Gifford. Mesh-Based Content Routing using XML. SOSP 2001.
26. R. L. Sproull. Refinements to Nearest-Neighbor Searching in k-Dimensional Trees. Algorithmica 6, 1987.
27. A. Tomasic, C. Garrod, K. Popendorf. Symmetric Publish/Subscribe via Constraint Publication. ExpDB 2006.
28. Yahoo! Advertising Targeting Options. advertising.yahoo.com/central/marketing/targeting.html