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

Skip to main content

Completing Queries: Rewriting of Incomplete Web Queries Under Schema Constraints

  • Conference paper
Web Reasoning and Rule Systems (RR 2007)

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

Included in the following conference series:

  • 367 Accesses

Abstract

Web queries have been and will remain an essential tool for accessing, processing, and, ultimately, reasoning with data on the Web. With the vast data size on the Web and Semantic Web, reducing costs of data transfer and query evaluation for Web queries is crucial. To reduce costs, it is necessary to narrow the data candidates to query, simplify complex queries and reduce intermediate results.

This article describes a static approach to optimization of web queries. We introduce a set of rules which achieves the desired optimization by schema and type based query rewriting. The approach consists in using schema information for removing incompleteness (as expressed by ‘descendant’ constructs and disjunctions) from queries. The approach is presented on the query language Xcerpt, though applicable to other query languages like XQuery. The approach is an application of rules in many aspects—query rules are optimized using rewriting rules based on schema or type information specified in grammar rules.

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 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  • Abiteboul, S., Buneman, P., Suciu, D.: Data on the Web: From Relations to Semistructured Data and XML. Morgan Kaufmann Publishers Inc. San Francisco (2000)

    Google Scholar 

  • Berger, S.: An Automaton Model for Xcerpt Type Checking and XML Schema Validation. REWERSE-TR-2007-01, Inst. for Computer Science, Univ. of Munich, Germany (2007)

    Google Scholar 

  • Berger, S., Bry, F.: Towards Static Type Checking of Web Query Language. In: Proc. Workshop über Grundlagen von Datenbanken (GvD) (2005)

    Google Scholar 

  • Berger, S., Coquery, E., Drabent, W., Wilk, A.: Descriptive Typing Rules for Xcerpt. In: PPSWR 2005. LNCS, vol. 3703, Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  • Boncz, P., Grust, T., van Keulen, M., Manegold, S., Rittinger, J., Teubner, J.: MonetDB/XQuery: a fast XQuery Processor powered by a Relational Engine. In: SIGMOD (2006)

    Google Scholar 

  • Brüggemann-Klein, A., Murata, M., Wood, D.: Regular tree and regular hedge languages over unranked alphabets. HKUST-TCSC-2001-0, Hongkong Univ. of Science and Tech. (2001)

    Google Scholar 

  • Bry, F., Schaffert, S.: Towards a Declarative Query and Transformation Language for XML and Semistructured Data: Simulation Unification. In: Stuckey, P.J. (ed.) ICLP 2002. LNCS, vol. 2401, Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  • Chamberlin, D., Frankhauser, P., Florescu, D., Marchiori, M., Robie, J.: XML Query Use Cases. Working draft, W3C (2005)

    Google Scholar 

  • Che, D., Aberer, K., Özsu, T.: Query Optimization in XML Structured-document Databases. The VLDB Journal 15(3), 263–289 (2006)

    Article  Google Scholar 

  • Common, H., Dauchet, M., Gilleron, R., Lugiez, F.J.D., Tison, S., Tommasi, M.: Tree automata techniques and applications (1999), http://www.grappa.univ-lille3.fr/tata

  • Fernandez, M.F., Suciu, D.: Optimizing Regular Path Expressions Using Graph Schemas. In: Proc. Int’l. Conf. on Data Engineering (ICDE) (1998)

    Google Scholar 

  • Koch, C.: On the Complexity of Nonrecursive XQuery and Functional Query Languages on Complex Values. In: Proc. ACM Symp. on Principles of Database Sys. (PODS) (2005)

    Google Scholar 

  • Olteanu, D.: SPEX: Streamed and Progressive Evaluation of XPath. IEEE Transactions on Knowledge and Data Engineering (2007)

    Google Scholar 

  • Olteanu, D., Meuss, H., Furche, T., Bry, F.: XPath: Looking Forward. In: Chaudhri, A.B., Unland, R., Djeraba, C., Lindner, W. (eds.) EDBT 2002. LNCS, vol. 2490, Springer, Heidelberg (2002)

    Google Scholar 

  • Schaffert, S., Bry, F.: Querying the Web Reconsidered: A Practical Introduction to Xcerpt. In: Proc. Extreme Markup Languages (2004)

    Google Scholar 

  • Schwentick, T.: XPath Query Containment. SIGMOD Record 33(1), 101–109 (2004)

    Article  MathSciNet  Google Scholar 

  • Su, H., Rundensteiner, E.A., Mani, M.: Semantic Query Optimization for XQuery over XML Streams. In: Proc. Int’l. Conf. on Very Large Data Bases (VLDB) (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Massimo Marchiori Jeff Z. Pan Christian de Sainte Marie

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this paper

Cite this paper

Berger, S., Bry, F., Furche, T., Häusler, A.J. (2007). Completing Queries: Rewriting of Incomplete Web Queries Under Schema Constraints. In: Marchiori, M., Pan, J.Z., Marie, C.d.S. (eds) Web Reasoning and Rule Systems. RR 2007. Lecture Notes in Computer Science, vol 4524. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72982-2_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-72982-2_26

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-72981-5

  • Online ISBN: 978-3-540-72982-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics