Regular path queries with constraints

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Serge Abiteboul, Querying Semi-Structured Data, Proceedings of the 6th International Conference on Database Theory, p.1-18, January 08-10, 1997
	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.
	3	Serge Abiteboul , Richard Hull , Victor Vianu, Foundations of Databases: The Logical Level, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1995
	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.
	5	Serge Abiteboul , Victor Vianu, Queries and Computation on the Web, Proceedings of the 6th International Conference on Database Theory, p.262-275, January 08-10, 1997
	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.
	7	Francois Bancilhon , David Maier , Yehoshua Sagiv , Jeffrey D Ullman, Magic sets and other strange ways to implement logic programs (extended abstract), Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems, p.1-15, March 24-26, 1986, Cambridge, Massachusetts, United States [doi>10.1145/6012.15399]
	8	C. Beeri , P. Kanellakis , F. Bancilhon , R. Ramakrishnan, Bounds on the propagation of selection into logic programs, Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.214-226, March 23-25, 1987, San Diego, California, United States [doi>10.1145/28659.28683]
	9	Peter Buneman , Susan Davidson , Gerd Hillebrand , Dan Suciu, A query language and optimization techniques for unstructured data, Proceedings of the 1996 ACM SIGMOD international conference on Management of data, p.505-516, June 04-06, 1996, Montreal, Quebec, Canada
	10	Mariano P. Consens , Alberto O. Mendelzon, GraphLog: a visual formalism for real life recursion, Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.404-416, April 02-04, 1990, Nashville, Tennessee, United States [doi>10.1145/298514.298591]
	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.
	12	Nachum Dershowitz , Jean-Pierre Jouannaud, Rewrite systems, Handbook of theoretical computer science (vol. B): formal models and semantics, MIT Press, Cambridge, MA, 1991
	13	Michael R. Garey , David S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman & Co., New York, NY, 1979
	14	P. G. Kolaitis , M. Otto, On the Boundedness Problem for Two-Variable First-Order Logic, Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science, p.513, June 21-24, 1998
	15	Erich Grädel , Martin Otto , Eric Rosen, Undecidability Results on Two-Variable Logics, Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science, p.249-260, February 27-March 01, 1997
	16	John E. Hopcroft , Jeffrey D. Ullman, Introduction To Automata Theory, Languages, And Computation, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1990
	17	Michael Kifer , Won Kim , Yehoshua Sagiv, Querying object-oriented databases, Proceedings of the 1992 ACM SIGMOD international conference on Management of data, p.393-402, June 02-05, 1992, San Diego, California, United States
	18	David Konopnicki , Oded Shmueli, W3QS: A Query System for the World-Wide Web, Proceedings of the 21th International Conference on Very Large Data Bases, p.54-65, September 11-15, 1995
	19	Alberto O. Mendelzon , George A. Mihaila , Tova Milo, Querying the World Wide Web, Proceedings of the fourth international conference on on Parallel and distributed information systems, p.80-91, December 18-20, 1996, Miami Beach, Florida, United States
	20	Alberto O. Mendelzon , Peter T. Wood, Finding Regular Simple Paths in Graph Databases, SIAM Journal on Computing, v.24 n.6, p.1235-1258, Dec. 1995 [doi>10.1137/S009753979122370X]
	21	M. Mortimer. On languages with two variables. geitschr, f. math. Logik u. Grundlagen d. Math, 21:135-140, 1975.
	22	J. F. Naughton, One-sided recursions, Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.340-348, March 23-25, 1987, San Diego, California, United States [doi>10.1145/28659.28695]
	23	Yannis Papakonstantinou , Serge Abiteboul , Hector Garcia-Molina, Object Fusion in Mediator Systems, Proceedings of the 22th International Conference on Very Large Data Bases, p.413-424, September 03-06, 1996
	24	Yannis Papakonstantinou , Hector Garcia-Molina , Jennifer Widom, Object Exchange Across Heterogeneous Information Sources, Proceedings of the Eleventh International Conference on Data Engineering, p.251-260, March 06-10, 1995
	25	Arto Salomaa, Two Complete Axiom Systems for the Algebra of Regular Events, Journal of the ACM (JACM), v.13 n.1, p.158-169, Jan. 1966 [doi>10.1145/321312.321326]
	26	Dan Suciu, Query Decomposition and View Maintenance for Query Languages for Unstructured Data, Proceedings of the 22th International Conference on Very Large Data Bases, p.227-238, September 03-06, 1996
	27	L. Vielle, Recursive query processing: the power of logic, Theoretical Computer Science, v.69 n.1, p.1-53, Dec. 5, 1989 [doi>10.1016/0304-3975(89)90088-1]