Serge Abiteboul
- 1.S. Abiteboul. Querying semistructured data. In Proceedings of the International Conference on Database The6ry, Delphi, Greece, 1997. Google Scholar
Digital Library
- 2.S. Abiteboul, S. Cluet, V. Christophides, T. Mile, G. Moerkotte, and Jerome Simeon. Querying documents in object databases. Journal of Digital Libraries, 1(1), 1997.Google Scholar
- 3.S. Abiteboul, R. Hull, and V. ~ianu. Foundations of Databases. Addison-Wesley, Reading- Massachusetts, 1995. Google ScholarDigital Library
- 4.S. Abiteboul, D. Quass, J. MeHugh, j. Widom, and J. Wiener. The lorel query language for semistructured data. Journal of Digital Libraries, 1(1), 1997.Google Scholar
- 5.S. Abiteboul and V. Vianu. Queries and computation on the Web. In Prec. of Intl. Conf. on Database Theory, pages 262-275, 1997. Google ScholarDigital Library
- 6.A.Buchsbaum, P.C.KaneUakis, and J.S.Vitter. A data structure for arc insertion and regular path finding. Annals of Math. and AI, 3:187-210, 1991.Google ScholarCross Ref
- 7.F. Bancilhon, D. Maier, Y. Sagiv, and J.D. Ullman. Magic sets and other strange ways to implement logic programs. In Prec. A CM Syrup. on Principles of Database Systems, pages 1-15, 1986. Google ScholarDigital Library
- 8.C. Beeri, P.C. Kanellakis, F.Banc'fihon, and R. Ramakrishnan. Bounds on the propagation of selection into logic programs. In Prec. A CM Syrup. on Principles of Database Systems, pages 214-226, 1987. Google ScholarDigital Library
- 9.P. Buneman, S. Davidson, G. HiUebrand, and D. Suciu. A query language and optimization techniques for unstructured data. In Prec. of the ACM SIGMOD Conf. on Management of Data, pages 505-516, 1996. Google ScholarDigital Library
- 10.M. Consens and A. Mendelzon. Graphlog: a visual formalism for real life recursion. In Prec. A GM Syrup. on Principles of Database Systems, pages 404-416, 1990. Google ScholarDigital Library
- 11.J. Van den Bussche and G. Vossen. An extensiort of path expressions to simplify navigation in objectoriented queries. In Prec. of Intl. Conf. on Deductive and Object-Oriented Databases (DOOD), pages 267-282, 1993.Google ScholarCross Ref
- 12.N. Dershowitz and J.P. Jouannaud. Rewrite systems. In J. Van Leeuwen, editor, Handbook of Theoretical Computer Science, pages 243-320. Elsevier, 1990. Google ScholarDigital Library
- 13.M. R. Garey and D. S. Johnson. Computers and In~ractibilitiy: A Guide to the Theory of NP- Completeness. Freeman, San Francisco, 1979. Google ScholarDigital Library
- 14.E. Graedel, P. Kolaitis, and M.Y. Vardi. On tho complexity of the decision problem for two-variable first-order logic. To appear. Google ScholarDigital Library
- 15.E. Graedel, M. Otto, and E. Rosen. Undeeidability results for two-variable logics. Extended abstract to appear in STACS'97. Google ScholarDigital Library
- 16.J. E. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979. Google ScholarDigital Library
- 17.M. Kifer, W. Kim, and Y. Sagiv. Querying objectoriented databases. In Prec. of the A CM SIG- MOD Conf. on Management of Data, pages 393- 402, 1992. Google ScholarDigital Library
- 18.D. Konopnicki and O. Shmueli. W3QS: A query system for the World Wide Web. In Prec. Int, Conf. on Very Large Data Bases (VLDB), pages 54-65, 1995. Google ScholarDigital Library
- 19.A. Mendelzotm, G. A. Mihaila, and T. Mile. Querying the World Wide Web. In Prec. PDIS, 1996. Google ScholarDigital Library
- 20.A. O. Mendelzon and P. T. Wood. Finding regular simple paths in graph databases. SIAM J. Getup., 24(6), 1995. Google ScholarDigital Library
- 21.M. Mortimer. On languages with two variables. geitschr, f. math. Logik u. Grundlagen d. Math, 21:135-140, 1975.Google Scholar
- 22.J.F. Naughton. One-sided reeursions. In Proc. A CM Syrup. on Principles of Database Systems, pages 340-348, 1987. Google ScholarDigital Library
- 23.Y. Papakonstantinou, S. Abiteboul, and H. Gareia- Molina. Object fusion in mediator systems. In Proceedings of the Twenty-Second International Conference on Very Large Data Bases, Bombay, india, 1996. Google ScholarDigital Library
- 24.Y. Papakonstantinou, H. Garcia-Molina, and J. Widom. Object exchange across heterogeneous information sources. In Proceedings of the Eleventh International Conference on Data Engineering, pages 251-260, Taipei, Taiwan, March 1995. Google ScholarDigital Library
- 25.A. Salomaa. Two complete axiom systems for the algebra of regular events. J. A CM, 13(1):158-169, 1966. Google ScholarDigital Library
- 26.D. Suciu. Query decomposition and view maintenance for query languages for unstructured data. In Proe. of Intl. Conf. on Very Large Data Bases, pages 227-238, 1996. Google ScholarDigital Library
- 27.L. Vieille. Recursive query processing: the power of logic. Theoretical Computer Science, 69(1):1-53, 1987. Google ScholarDigital Library
Index Terms
- Regular path queries with constraints
Recommendations
Query containment and rewriting using views for regular path queries under constraints
PODS '03: Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systemsIn this paper we consider general path constraints for semistructured databases. Our general constraints do not suffer from the limitations of the path constraints previously studied in the literature. We investigate the containment of regular path ...
Parametric regular path queries
PLDI '04: Proceedings of the ACM SIGPLAN 2004 conference on Programming language design and implementationRegular path queries are a way of declaratively expressing queries on graphs as regular-expression-like patterns that are matched against paths in the graph. There are two kinds of queries: existential queries, which specify properties about individual ...
Regular path queries under approximate semantics
We give a general framework for approximate query processing in semistructured databases. We focus on regular path queries, which are the integral part of most of the query languages for semistructured databases. To enable approximations, we allow the ...
Comments