SINBAD: towards structure-independent querying of common neighbors in XML databases

  • Authors:

  • Ba Quan Truong;Sourav S. Bhowmick;Curtis Dyreson

  • Affiliations:

  • School of Computer Engineering, Nanyang Technological University, Singapore;School of Computer Engineering, Nanyang Technological University, Singapore;Department of Computer Science, Utah State University

  • Venue:
  • DASFAA'12 Proceedings of the 17th international conference on Database Systems for Advanced Applications - Volume Part I
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

xml query languages use directional path expressions to locate data in an xml data collection. They are tightly coupled to the structure of a data collection, and can fail when evaluated on the same data in a different structure. This paper extends XPath expressions with a new structure-independent, non-directional axis called the neighborhood axis. Given a pair of context nodes, the neighborhood axis returns those nodes that are common neighbors of the context nodes in any direction. Such axis finds its usefulness in structure-independent query formulation as well as supporting relevant results computation in design-independent xml keyword search. We propose an algorithm called sinbad that exploits the novel notion of node locality and small size of xmlstructure tree to efficiently determine the common neighbors of the context nodes. Our empirical study demonstrates that sinbad, built on top of an existing path materialization-based relational storage scheme, has promising query performance.