SINBAD: Towards Structure-Independent Querying of Common Neighbors in XML Databases

  • Ba Quan Truong
  • Sourav S. Bhowmick
  • Curtis Dyreson
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7238)

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 xml structure 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.

Keywords

Child Node Node Locality Common Neighbor Full Document Manager Node 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bhowmick, S.S., Dyreson, C., et al.: Towards Non-Directional XPath Evaluation in a RDBMS. In: CIKM (2009)Google Scholar
  2. 2.
    Brodianskiy, T., Cohen, S.: Self-Correcting Queries in XML. In: CIKM (2007)Google Scholar
  3. 3.
    Cohen, S., Mamou, J., Kanza, Y., Sagiv, Y.: XSEarch: A Semantic Search Engine for XML. In: VLDB (2003)Google Scholar
  4. 4.
    Curino, C.A., Moon, H.J., Zaniolo, C.: Graceful Database Schema Evolution: The Prism Workbench. In: VLDB (2008)Google Scholar
  5. 5.
    Goldman, R., Widom, J.: DataGuides: Enabling Query Formulation and Optimization in Semistructured Databases. In: VLDB (1997)Google Scholar
  6. 6.
    Gou, G., Chirkova, R.: Efficiently Querying Large xml Data Repositories: A Survey. IEEE TKDE 19(10) (2007)Google Scholar
  7. 7.
    Li, Y., Yu, C., Jagadish, H.V.: Schema-Free XQuery. In: VLDB (2004)Google Scholar
  8. 8.
    Liu, Z., Chen, Y.: Identifying Meaningful Return Information for XML Keyword Search. In: SIGMOD (2007)Google Scholar
  9. 9.
    Liu, Z., Chen, Y.: Reasoning and Identifying Relevant Matches for XML Keyword Search. In: VLDB (2007)Google Scholar
  10. 10.
    Soh, K.H., Bhowmick, S.S.: Efficient Evaluation of not-Twig Queries in A Tree-Unaware RDBMS. In: Yu, J.X., Kim, M.H., Unland, R. (eds.) DASFAA 2011, Part I. LNCS, vol. 6587, pp. 511–527. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  11. 11.
    Termehchy, A., Winslett, M., Chodpathumwan, Y.: How Schema Independent Are Schema Free Query Interfaces? In: ICDE (2011)Google Scholar
  12. 12.
    Velegrakis, Y., Miller, R.J., Popa, L.: Mapping Adaptation Under Evolving Schemas. In: VLDB (2003)Google Scholar
  13. 13.
    Xu, Y., Papakonstantinou, Y.: Efficient Keyword Search for Smallest LCAs in XML Databases. In: SIGMOD (2005)Google Scholar
  14. 14.
    Yao, B., Tamer Özsu, M., Khandelwal, N.: XBench: Benchmark and Performance Testing of XML DBMSs. In: ICDE (2004)Google Scholar
  15. 15.
    Zhang, S., Dyreson, C.: Symmetrically Exploiting XML. In: WWW (2006)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Ba Quan Truong
    • 1
  • Sourav S. Bhowmick
    • 1
  • Curtis Dyreson
    • 2
  1. 1.School of Computer EngineeringNanyang Technological UniversitySingapore
  2. 2.Department of Computer ScienceUtah State UniversityUSA

Personalised recommendations