Computational geometry: an introduction
Computational geometry: an introduction
A randomized algorithm for closest-point queries
SIAM Journal on Computing
Introduction to algorithms
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
A framework for expressing and combining preferences
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Filtering algorithms and implementation for very fast publish/subscribe systems
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Mesh-based content routing using XML
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Querying with Intrinsic Preferences
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
Approximate Query Processing Using Wavelets
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
An asymptotically optimal multiversion B-tree
The VLDB Journal — The International Journal on Very Large Data Bases
The R-tree: An Improved R*-tree with Materialized Data for Supporting Range Queries on OLAP-Data
DEXA '98 Proceedings of the 9th International Workshop on Database and Expert Systems Applications
Optimal aggregation algorithms for middleware
Journal of Computer and System Sciences - Special issu on PODS 2001
Forwarding in a content-based network
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
An Efficient Multicast Protocol for Content-Based Publish-Subscribe Systems
ICDCS '99 Proceedings of the 19th IEEE International Conference on Distributed Computing Systems
Path sharing and predicate evaluation for high-performance XML filtering
ACM Transactions on Database Systems (TODS)
Modeling Uncertainties in Publish/Subscribe Systems
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
RankSQL: query algebra and optimization for relational top-k queries
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Answering bounded continuous search queries in the world wide web
Proceedings of the 16th international conference on World Wide Web
Scalable event matching for overlapping subscriptions in pub/sub systems
Proceedings of the 2007 inaugural international conference on Distributed event-based systems
Towards an internet-scale XML dissemination service
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Computational Geometry: Algorithms and Applications
Computational Geometry: Algorithms and Applications
Rank-Sensitive data structures
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
RRPS: A Ranked Real-Time Publish/Subscribe Using Adaptive QoS
ICCSA '09 Proceedings of the International Conference on Computational Science and Its Applications: Part II
Preference-aware publish/subscribe delivery with diversity
Proceedings of the Third ACM International Conference on Distributed Event-Based Systems
Proceedings of the VLDB Endowment
Efficient online ad serving in a display advertising exchange
Proceedings of the fourth ACM international conference on Web search and data mining
Efficiently evaluating graph constraints in content-based publish/subscribe
Proceedings of the 20th international conference on World wide web
Enabling fast prediction for ensemble models on data streams
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Towards an extensible efficient event processing kernel
PhD '12 Proceedings of the on SIGMOD/PODS 2012 PhD Symposium
Subscription indexes for web syndication systems
Proceedings of the 15th International Conference on Extending Database Technology
Approximate semantic matching of heterogeneous events
Proceedings of the 6th ACM International Conference on Distributed Event-Based Systems
Analysis and optimization for boolean expression indexing
ACM Transactions on Database Systems (TODS)
Top-k publish-subscribe for social annotation of news
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
Publish/subscribe (pub/sub) systems are designed to efficiently match incoming events (e.g., stock quotes) against a set of subscriptions (e.g., trader profiles specifying quotes of interest). However, current pub/sub systems only support a simple binary notion of matching: an event either matches a subscription or it does not; for instance, a stock quote will either match or not match a trader profile. In this paper, we argue that this simple notion of matching is inadequate for many applications where only the "best" matching subscriptions are of interest. For instance, in targeted Web advertising, an incoming user ("event") may match several different advertiser-specified user profiles ("subscriptions"), but given the limited advertising real-estate, we want to quickly discover the best (e.g., most relevant) ads to display. To address this need, we initiate a study of ranked pub/sub systems. We focus on the case where subscriptions correspond to interval ranges (e.g, age in [25,35] and salary $50, 000), and events are points that match all the intervals that they stab (e.g., age=28, salary = $65,000). In addition, each interval has a score and our goal is to quickly recover the top-scoring matching subscriptions. Unfortunately, adapting existing index structures to solve this problem results in either an unacceptable space overhead or a significant performance degradation. We thus propose two novel index structures that are both compact and efficient. Our experimental evaluation shows that the proposed structures provide a scalable basis for designing ranked pub/sub systems.