Journal
PROCEEDINGS OF THE VLDB ENDOWMENT
Volume 7, Issue 8, Pages 613-624Publisher
ASSOC COMPUTING MACHINERY
DOI: 10.14778/2732296.2732298
Keywords
-
Funding
- NExT Search Centre [R-252300-001-490]
- Singapore National Research Foundation under its International Research Centre @ Singapore
Ask authors/readers for more resources
Many of today's publish/subscribe (pub/sub) systems have been designed to cope with a large volume of subscriptions and high event arrival rate (velocity). However, in many novel applications (such as e-commerce), there is an increasing variety of items, each with different attributes. This leads to a very high-dimensional and sparse database that existing pub/sub systems can no longer support effectively. In this paper, we propose an efficient in-memory index that is scalable to the volume and update of subscriptions, the arrival rate of events and the variety of subscribable attributes. The index is also extensible to support complex scenarios such as prefix/suffix filtering and regular expression matching. We conduct extensive experiments on synthetic datasets and two real datasets (AOL query log and Ebay products). The results demonstrate the superiority of our index over state-of-the-art methods: our index incurs orders of magnitude less index construction time, consumes a small amount of memory and performs event matching efficiently.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available