Skip to main content
SpringerLink
Log in
Book cover

International Conference on Web Information Systems Engineering

WISE 2012: Web Information Systems Engineering - WISE 2012 pp 128–142Cite as

An Extended Compact TVP Index for Finding Top-k Nearest Neighbors over XML Data Tree

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 7651))

Abstract

Given a node q and a keyword w, nearest keyword (NK) search is to find the nearest w-neighbor of q which carries the keyword w. NK search provides an approach to exploring XML query problems based on the distance between nodes, such as XPath evaluation and XML keyword search. In this paper, we propose an extended compact TVP index (ecTVP) tailored to find top-k nearest w-neighbors of a given node in XML data tree. The ecTVP index is more compact and faster to build. Both theoretical analysis and experimental result show the advantage of the ecTVP index.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bao, Z., Ling, T.W., Chen, B., Lu, J.: Effective XML Keyword Search with Relevance Oriented Ranking. In: ICDE, pp. 517–528 (2009)

    Google Scholar 

  2. Guo, L., Shao, F., Botev, C., Shanmugasundaram, J.: XRANK: Ranked Keyword Search over XML Documents. In: SIGMOD Conference, pp. 16–27 (2003)

    Google Scholar 

  3. Hristidis, V., Koudas, N., Papakonstantinou, Y., Srivastava, D.: Keyword Proximity Search in XML Trees. IEEE Trans. Knowl. Data Eng. 18(4), 525–539 (2006)

    Article  Google Scholar 

  4. Kasneci, G., Ramanath, M., Sozio, M., Suchanek, F.M., Weikum, G.: STAR: Steiner-Tree Approximation in Relationship Graphs. In: ICDE, pp. 868–879 (2009)

    Google Scholar 

  5. Tao, Y., Papadopoulos, S., Sheng, C., Stefanidis, K.: Nearest keyword search in XML documents. In: SIGMOD Conference, pp. 589–600 (2011)

    Google Scholar 

  6. Termehchy, A., Winslett, M.: Using Structural Information in XML Keyword Search Effectively. ACM Trans. Database Syst. 36(1), 4 (2011)

    Article  Google Scholar 

  7. Xu, Y., Papakonstantinou, Y.: Efficient Keyword Search for Smallest LCAs in XML Databases. In: SIGMOD Conference, pp. 537–538 (2005)

    Google Scholar 

  8. Xu, Y., Papakonstantinou, Y.: Efficient LCA based keyword search in XML data. In: EDBT, pp. 535–546 (2008)

    Google Scholar 

  9. Yang, J., Widom, J.: Incremental computation and maintenance of temporal aggregates. VLDB J. 12(3), 262–283 (2003)

    Article  Google Scholar 

  10. Zhou, R., Liu, C., Li, J.: Fast ELCA computation for keyword queries on XML data. In: EDBT, pp. 549–560 (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Information and Communication Technology, Griffith University, Gold Coast Campus, Australia

    Sheng Li & Junhu Wang

Authors
  1. Sheng Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Junhu Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science, Fudan University, 825 Zhangheng Rd., Shanghai, 201203, China

    X. Sean Wang

  2. Department of Computer Science, College of Engineering, Science and Engineering Offices, The University of Illinois at Chicago, 851 South Morgan Street (M/C 152), 60607-7053, Chicago, Illinois, USA

    Isabel Cruz

  3. Department of Informatics and Telecommunications, University of Athens, GR15784, Ilisia, Athens, Greece

    Alex Delis

  4. Centre for Applied Informatics, Victoria University, PO Box 14428, 8001, Melbourne, VIC, Australia

    Guangyan Huang

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Li, S., Wang, J. (2012). An Extended Compact TVP Index for Finding Top-k Nearest Neighbors over XML Data Tree. In: Wang, X.S., Cruz, I., Delis, A., Huang, G. (eds) Web Information Systems Engineering - WISE 2012. WISE 2012. Lecture Notes in Computer Science, vol 7651. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35063-4_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-35063-4_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-35062-7

  • Online ISBN: 978-3-642-35063-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation