{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T03:06:01Z","timestamp":1787022361938,"version":"build-2736575974"},"reference-count":28,"publisher":"Association for Computing Machinery (ACM)","issue":"8","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2014,4]]},"abstract":"<jats:p>\n                    Many of today's publish\/subscribe (pub\/sub) systems have been designed to cope with a large\n                    <jats:italic>volume<\/jats:italic>\n                    of subscriptions and high event arrival rate (\n                    <jats:italic>velocity<\/jats:italic>\n                    ). However, in many novel applications (such as e-commerce), there is an increasing\n                    <jats:italic>variety<\/jats:italic>\n                    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.\n                  <\/jats:p>","DOI":"10.14778\/2732296.2732298","type":"journal-article","created":{"date-parts":[[2015,5,12]],"date-time":"2015-05-12T11:37:52Z","timestamp":1431430672000},"page":"613-624","source":"Crossref","is-referenced-by-count":49,"title":["An efficient publish\/subscribe index for e-commerce databases"],"prefix":"10.14778","volume":"7","author":[{"given":"Dongxiang","family":"Zhang","sequence":"first","affiliation":[{"name":"National University of Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chee-Yong","family":"Chan","sequence":"additional","affiliation":[{"name":"National University of Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kian-Lee","family":"Tan","sequence":"additional","affiliation":[{"name":"National University of Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2014,4]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"Freebase Data Dumps. https:\/\/developers.google.com\/freebase\/data.  Freebase Data Dumps. https:\/\/developers.google.com\/freebase\/data."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/863955.863975"},{"key":"e_1_2_1_4_1","first-page":"263","volume-title":"VLDB","author":"Chan C. Y.","year":"2002","unstructured":"C. Y. Chan , M. N. Garofalakis , and R. Rastogi . Re-tree: An efficient index structure for regular expressions . In VLDB , pages 263 -- 274 , 2002 . C. Y. Chan, M. N. Garofalakis, and R. Rastogi. Re-tree: An efficient index structure for regular expressions. In VLDB, pages 263--274, 2002."},{"key":"e_1_2_1_5_1","first-page":"878","volume-title":"VLDB","author":"Chandramouli B.","year":"2007","unstructured":"B. Chandramouli , J. Phillips , and J. Yang . Value-based notification conditions in large-scale publish\/subscribe systems . In VLDB , pages 878 -- 889 , 2007 . B. Chandramouli, J. Phillips, and J. Yang. Value-based notification conditions in large-scale publish\/subscribe systems. In VLDB, pages 878--889, 2007."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453905"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1880018.1880020"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497455"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/11687238_38"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/958942.958947"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687749"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/375663.375677"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1147234.1147241"},{"key":"e_1_2_1_14_1","first-page":"254","volume-title":"Middleware","author":"Gupta A.","year":"2004","unstructured":"A. Gupta , O. D. Sahin , D. Agrawal , and A. El Abbadi . Meghdoot: Content-based publish\/subscribe over p2p networks . In Middleware , pages 254 -- 273 , 2004 . A. Gupta, O. D. Sahin, D. Agrawal, and A. El Abbadi. Meghdoot: Content-based publish\/subscribe over p2p networks. In Middleware, pages 254--273, 2004."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247564"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453906"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497444"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247563"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213866"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989390"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.38"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487259.2487260"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/966618.966627"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.14778\/2002938.2002939"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807085.1807097"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687633"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142473.1142520"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213891"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/176567.176573"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/2732296.2732298","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T04:17:30Z","timestamp":1672201050000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/2732296.2732298"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4]]},"references-count":28,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2014,4]]}},"alternative-id":["10.14778\/2732296.2732298"],"URL":"https:\/\/doi.org\/10.14778\/2732296.2732298","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2014,4]]}}}