Combining fuzzy information from multiple systems
Journal of Computer and System Sciences
On Relevance, Probabilistic Indexing and Information Retrieval
Journal of the ACM (JACM)
Computer Evaluation of Indexing and Text Processing
Journal of the ACM (JACM)
Achieving scalability and expressiveness in an Internet-scale event notification service
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Filtering algorithms and implementation for very fast publish/subscribe systems
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Models and issues in data stream systems
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Modern Information Retrieval
Continually evaluating similarity-based pattern queries on a streaming time series
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Top-k selection queries over relational databases: Mapping strategies and performance evaluation
ACM Transactions on Database Systems (TODS)
Introduction to Algorithms
Hermes: A Distributed Event-Based Middleware Architecture
ICDCSW '02 Proceedings of the 22nd International Conference on Distributed Computing Systems
Filter Similarities in Content-Based Publish/Subscribe Systems
ARCS '02 Proceedings of the International Conference on Architecture of Computing Systems: Trends in Network and Pervasive Computing
Modeling Uncertainties in Publish/Subscribe Systems
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
XNET: A Reliable Content-Based Publish/Subscribe System
SRDS '04 Proceedings of the 23rd IEEE International Symposium on Reliable Distributed Systems
Disseminating Information to Mobile Clients Using Publish-Subscribe
IEEE Internet Computing
Stabbing the Sky: Efficient Skyline Computation over Sliding Windows
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
LighTS: a lightweight, customizable tuple space supporting context-aware applications
Proceedings of the 2005 ACM symposium on Applied computing
Analysis and Algorithms for Content-Based Event Matching
ICDCSW '05 Proceedings of the Fourth International Workshop on Distributed Event-Based Systems (DEBS) (ICDCSW'05) - Volume 04
KLEE: a framework for distributed top-k query algorithms
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Uncertain event-based model for egocentric context sensing
SEM '05 Proceedings of the 5th international workshop on Software engineering and middleware
Continuous monitoring of top-k queries over sliding windows
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Revisiting Content-Based Publish/Subscribe
ICDCSW '06 Proceedings of the 26th IEEE International ConferenceWorkshops on Distributed Computing Systems
Distributed Event-Based Systems
Distributed Event-Based Systems
Fuzzy Logic-Based Event Notification in Sparse MANETs
AINAW '07 Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02
A-TOPSS: a publish/subscribe system supporting approximate matching
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Approximate NN queries on streams with guaranteed error/performance bounds
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
A-ToPSS: a publish/subscribe system supporting imperfect information processing
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Ad-hoc top-k query answering for data streams
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
GREEN: a configurable and re-configurable publish-subscribe middleware for pervasive computing
OTM'05 Proceedings of the 2005 Confederated international conference on On the Move to Meaningful Internet Systems - Volume >Part I
Semantic peer-to-peer overlays for publish/subscribe networks
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
BNCOD 26 Proceedings of the 26th British National Conference on Databases: Dataspace: The Final Frontier
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
Approximate semantic matching of heterogeneous events
Proceedings of the 6th ACM International Conference on Distributed Event-Based Systems
Language expressiveness and quality of service for publish/subscribe systems
Proceedings of the 9th Middleware Doctoral Symposium of the 13th ACM/IFIP/USENIX International Middleware Conference
Top-k publish-subscribe for social annotation of news
Proceedings of the VLDB Endowment
Hi-index | 0.00 |
Existing content-based publish/subscribe systems are designed assuming that all matching publications are equally relevant to a subscription. As we cannot know in advance the distribution of publication content, the following two unwanted situations are highly possible: a subscriber either receives too many or only few publications. In this paper we present a new publish/subscribe model which is based on the sliding window computation model. Our model assumes that publications have different relevance to a subscription. In the model, a subscriber receives k most relevant publications published within a time window w, where k and w are parameters defined per each subscription. As a consequence, the arrival rate of incoming relevant publications per subscription is predefined, and does not depend on the publication rate. Since all relevant objects (i.e. publications in our case) cannot be kept in main memory, existing solutions immediately discard less relevant objects, and store only a small representative set for subsequent delivery. In this paper we develop a probabilistic criterion to decide upon the arrival of a new object whether it may become the top-k object at some future point in time and should thus be stored in a special publications queue. We show that by accepting typically very small probability of error, the queue length is reasonably small and does not significantly depend on publication rate. Furthermore, we experimentally evaluate our approach to demonstrate its applicability in practice.