Answering regular path queries using views

Query answering using views amounts to computing the answer to a query having information only on the extension of a set of views. This problem is relevant in several fields, such as information integration, data warehousing, query optimization, mobile computing, and maintaining physical data independence. We address query answering using views in a context where queries and views are regular path queries, i.e., regular expressions that denote the pairs of objects in the database connected by a matching path. Regular path queries are the basic query mechanism when the database is conceived as a graph, such as in semistructured data and data on the Web. We study algorithms for answering regular path queries using views under different assumptions, namely, closed and open domain, and sound, complete, and exact information on view extensions. We characterize data, expression, and combined complexity of the problem, showing that the proposed algorithms are essentially optimal. Our results are the first to exhibit decidability in cases where the language for expressing the query and the views allows for recursion.

[1]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[2]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[3]  Moshe Y. Vardi.  The complexity of relational query languages (Extended Abstract) , 1982, STOC '82.

[4]  Matthew L. Ginsberg,et al.  Readings in Nonmonotonic Reasoning , 1987, AAAI 1987.

[5]  R. Reiter.  On Closed World Data Bases , 1987, Logic and Data Bases.

[6]  Tomasz Imielinski,et al.  Sleepers and workaholics: caching strategies in mobile environments , 1994, SIGMOD '94.

[7]  Jeffrey D. Ullman,et al.  Answering queries using templates with binding patterns (extended abstract) , 1995, PODS '95.

[8]  Divesh Srivastava,et al.  Answering Queries Using Views. , 1999, PODS 1995.

[9]  Kyuseok Shim,et al.  Optimizing queries with materialized views , 1995, Proceedings of the Eleventh International Conference on Data Engineering.

[10]  H. Garcia-Molina,et al.  The Stanford Data Warehousing Project , 1995, IEEE Data Eng. Bull..

[11]  Divesh Srivastava,et al.  Answering Queries Using Views. , 1999, PODS 1995.

[12]  Anand Rajaraman,et al.  Answering queries using templates with binding patterns (extended abstract) , 1995, PODS.

[13]  Marvin H. Solomon,et al.  The GMAP: a versatile tool for physical data independence , 1996, The VLDB Journal.

[14]  Divesh Srivastava,et al.  Answering Queries with Aggregation Using Views , 1996, VLDB.

[15]  Dan Suciu,et al.  A query language and optimization techniques for unstructured data , 1996, SIGMOD '96.

[16]  Alon Y. Levy.  Obtaining Complete Answers from Incomplete Databases , 1996, VLDB 1996.

[17]  Jeffrey D. Ullman,et al.  Information integration using logical views , 1997, Theoretical Computer Science.

[18]  Jennifer Widom,et al.  Querying Semistructured Heterogeneous Information , 1997, J. Syst. Integr..

[19]  Jennifer Widom,et al.  The Lorel query language for semistructured data , 1997, International Journal on Digital Libraries.

[20]  Dan Suciu,et al.  Adding Structure to Unstructured Data , 1997, ICDT.

[21]  Michael R. Genesereth,et al.  Answering recursive queries using views , 1997, PODS '97.

[22]  Serge Abiteboul,et al.  Querying Semi-Structured Data , 1997, Encyclopedia of Database Systems.

[23]  Peter Buneman,et al.  Semistructured data , 1997, PODS.

[24]  Catriel Beeri,et al.  Rewriting queries using views in description logics , 1997, PODS '97.

[25]  Alberto O. Mendelzon,et al.  Database techniques for the World-Wide Web: a survey , 1998, SGMD.

[26]  Alin Deutsch,et al.  XML-QL: A Query Language for XML , 1998 .

[27]  Dan Suciu,et al.  Catching the boat with Strudel: experiences with a Web-site management system , 1998, SIGMOD '98.

[28]  Serge Abiteboul,et al.  Complexity of answering queries using materialized views , 1998, PODS.

[29]  Dan Suciu,et al.  Optimizing regular path expressions using graph schemas , 1998, Proceedings 14th International Conference on Data Engineering.

[30]  Yannis Papakonstantinou,et al.  Query Rewriting using Semistructured Views , 1999 .

[31]  Werner Nutt,et al.  Rewriting aggregate queries using views , 1999, PODS.

[32]  Alberto O. Mendelzon,et al.  Tableau Techniques for Querying Information Sources through Global Schemas , 1999, ICDT.

[33]  Maurizio Rafanelli,et al.  Querying aggregate data , 1999, PODS '99.

[34]  Diego Calvanese,et al.  Rewriting of regular expressions and regular path queries , 1999, PODS '99.

[35]  Manolis Gergatsoulis,et al.  Answering Queries Using Materialized Views with Disjunctions , 1999, ICDT.

[36]  Dan Suciu,et al.  Index Structures for Path Expressions , 1999, ICDT.

[37]  Jeffrey D. Ullman,et al.  Information integration using logical views , 1997, Theor. Comput. Sci..