NDLI: H-Tree: An efficient index structure for event matching in publish/subscribe systems

Content Provider	IEEE Xplore Digital Library
Author	Shiyou Qian Jian Cao Yanmin Zhu Minglu Li Jie Wang
Copyright Year	2013
Description	Author affiliation: Shanghai Jiao Tong Univ., Shanghai, China (Shiyou Qian; Jian Cao; Yanmin Zhu; Minglu Li) \|\| Stanford Univ., Stanford, CA, USA (Jie Wang)
Abstract	Content-based publish/subscribe systems have been employed to deal with complex distributed information flows in many applications. It is well recognized that event matching is a fundamental component of such large-scale systems. Event matching is to search in a space which is composed of all subscriptions. As the scale and complexity of a system grow, the efficiencies of event matching become more critical to the system performance. Most existing methods suffer performance degradation problem when a system has both large number of subscriptions and large number of constraints. In this paper, we present H-Tree (Hash Tree), a highly efficient index structure for event matching. H-Tree is a hash table in nature which is a combination of hash lists and hash chaining. A hash list is realized on an indexed attribute by dividing the attribute's value domain into cells. Multiple hash lists are chained into a hash tree. The basic idea behind H-Tree is that matching efficiencies are improved when the search space is substantially reduced by pruning most of the impossible subscriptions. We have implemented H-Tree and conducted extensive experiments in different settings. Experimental results show that H-Tree outperforms its counterparts to a large degree. In particular, the matching time is faster by three order of magnitude than its counterparts when both the number of subscriptions and the number of constraints are large.
Starting Page	1
Ending Page	9
File Size	725689
Page Count	9
File Format	PDF
ISBN	9783901882555
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2013-05-22
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	IFIP
Subject Keyword	Performance evaluation Upper bound Subscriptions Indexes Time complexity Standards
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Efficient Event Matching in Publish/subscribe: Based on Routing Destination and Matching History

Scalable event matching for overlapping subscriptions in pub/sub systems

Efficient matching of SPARQL subscriptions using rete

PUBSUB: An efficient publish/subscribe system

Queue reorganization for subscription congestion avoidance in publish/subscribe systems

REIN: A fast event matching approach for content-based publish/subscribe systems

PUBSUB: An Efficient Publish/Subscribe System

Predicate Priority Based Event Matching Algorithm in Publish/Subscribe System

Sub-order Non-duplication Event Matching Algorithm for Stateful Publish/Subscribe Systems

H-Tree: An efficient index structure for event matching in publish/subscribe systems

Similar Documents

Efficient Event Matching in Publish/subscribe: Based on Routing Destination and Matching History

Scalable event matching for overlapping subscriptions in pub/sub systems

Efficient matching of SPARQL subscriptions using rete

PUBSUB: An efficient publish/subscribe system

Queue reorganization for subscription congestion avoidance in publish/subscribe systems

REIN: A fast event matching approach for content-based publish/subscribe systems

PUBSUB: An Efficient Publish/Subscribe System

Predicate Priority Based Event Matching Algorithm in Publish/Subscribe System

Sub-order Non-duplication Event Matching Algorithm for Stateful Publish/Subscribe Systems

H-Tree: An efficient index structure for event matching in publish/subscribe systems