Nothing Special   »   [go: up one dir, main page]

Skip to main content

A Prüfer Based Approach to Process Top-k Queries in XML

  • Conference paper
Database and Expert Systems Applications (DEXA 2009)

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

Included in the following conference series:

  • 941 Accesses

Abstract

Top-k queries in XML involves retrieving approximate matching XML documents. Existing techniques process top-k queries in XML by applying one or more relaxations on the twig query. In this work, we investigate how Prüfer sequence can be utilized to process top-k queries in XML. We design a method called XPRAM that incorporates the relaxations into the sequence matching process. Experiment results indicate that the proposed approach is efficient and scalable.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Al-Khalifa, S., Yu, C., Jagadish, H.V.: Querying structured text in an xml database. In: ACM SIGMOD (2003)

    Google Scholar 

  2. Amer-Yahia, S., Koudas, N., Marian, A.: Structure and content scoring for xml. In: VLDB (2005)

    Google Scholar 

  3. Amer-Yahia, S., Lakshmanan, L.V.S., Pandit, S.: Flexpath: Flexible structure and full-text querying for xml. In: ACM SIGMOD (2004)

    Google Scholar 

  4. Botev, C., Shanmugasundaram, J., Amer-Yahia, S.: A texquery-based xml full-text search engine. In: ACM SIGMOD (2004)

    Google Scholar 

  5. Guo, L., Shao, F., Botev, C., Shanmugasundaram, J.: Xrank: Ranked keyword search over xml documents. In: ACM SIGMOD (2003)

    Google Scholar 

  6. Kaushik, R., Krishnamurthy, R., Naughton, J.F., Ramakrishnan, R.: On the integration of structure indexes and inverted lists. In: ACM SIGMOD (2004)

    Google Scholar 

  7. Marian, A., Amer-Yahia, S., Koudas, N., Srivastava, D.: Adaptive processing of top-k queries in xml. In: IEEE ICDE (2005)

    Google Scholar 

  8. Rao, P., Moon, B.: Prix: Indexing and querying xml using prufer sequences. In: IEEE ICDE (2004)

    Google Scholar 

  9. Tatikonda, S., Parthasarathy, S., Goyder, M.: Lcs-trim: Dynamic programming meets xml indexing and querying. In: VLDB (2007)

    Google Scholar 

  10. Zhen, H., Lee, M.L., Hsu, W.: Answering top-k queries in xml (submitted, 2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Li, L., Lee, M.L., Hsu, W., Zhen, H. (2009). A Prüfer Based Approach to Process Top-k Queries in XML. In: Bhowmick, S.S., Küng, J., Wagner, R. (eds) Database and Expert Systems Applications. DEXA 2009. Lecture Notes in Computer Science, vol 5690. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03573-9_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-03573-9_29

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-03572-2

  • Online ISBN: 978-3-642-03573-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics