Skip to main content

DMT: A Flexible and Versatile Selectivity Estimation Approach for Graph Query

  • Conference paper
Advances in Web-Age Information Management (WAIM 2005)

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

Included in the following conference series:

Abstract

Efficient and accurate selectivity estimation in graph-structured data, specifically for complex branching path query, is becoming a challenging and all-important problem for query performance optimization. Precise and flexible statistics summarization about graph-structured data plays a crucial role for graph query selectivity estimation. We propose DMT, Dynamic Markov Table, which is a dynamic graph summarization based on Markov Table by applying flexible combination of 4 Optimized Rules which investigate local forward and backward inclusions. The efficient DMT construction algorithm DMTBuilder and DMT-based statistical methods are introduced for selectivity estimations of various graph queries. Our extensive experiments demonstrate the advantages in accuracy and scalability of DMT by comparing with previously known alternative, as well as the preferred Optimized Rules that would favor different situations.

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

Access this chapter

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.

References

  1. Aboulnaga, A., Alameldeen, A.R., Naughton, J.F.: Estimating the selectivity of XML path expressions for internet scale applications. In: VLDB 2001 (2001)

    Google Scholar 

  2. Bray, T., Paoli, J., Sperberg-McQueen, C.M., Maler, E.: Extensible Markup Language (XML) 1.0 (2nd edn.). W3C Recommendation (October 2000)

    Google Scholar 

  3. Chen, Z., Jagadish, H.V., Korn, F., Koudas, N., Muthukrishnan, S., Ng, R., Srivastava, D.: Counting twig matches in a tree. In: Proc. IEEE Int. Conf. on Data Engineering, Heidelberg, Germany, April 2001, pp. 595–604 (2001)

    Google Scholar 

  4. Ley, M.: DBLP XML records (2001)

    Google Scholar 

  5. Lim, L., Wang, M., Padmanabhan, S., Vitter, J., Parr, R.: XPathLearner: An On-Line Self-Tuning Markov Histogram for XML Path Selectivity Estimation. In: VLDB 2002 (2002)

    Google Scholar 

  6. Polyzotis, N., Garofalakis, M.: Statistical Synopses for Graph-Structured XML Databases. In: SIGMOD 2002 (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Feng, J., Qian, Q., Liao, Y., Li, G., Ta, N. (2005). DMT: A Flexible and Versatile Selectivity Estimation Approach for Graph Query. In: Fan, W., Wu, Z., Yang, J. (eds) Advances in Web-Age Information Management. WAIM 2005. Lecture Notes in Computer Science, vol 3739. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11563952_61

Download citation

  • DOI: https://doi.org/10.1007/11563952_61

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29227-2

  • Online ISBN: 978-3-540-32087-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics