Peter Buneman
Wenfei Fan
- 1.S. Abiteboul. "Querying semi-structured data". In Proc. ICDT, 1997. Google Scholar
Digital Library
- 2.S. Abiteboul, D. Quass, I. McHugh, J. Widom, and J. Weiner. "The Iorel query language for semista~ctured data". Journal of Digital Libraries, 1(1), 1997.Google Scholar
- 3.S. Abiteboul and V. Vianu. "Regular path queries with constraints", In Proc. A CM Syrup. on Principles of Database Systems, 1997. Google ScholarDigital Library
- 4.F. Baneilhon, C. Delobel, and P. Kanellakis, editors. Building an object-oriented database aystem: the story of 02. Morgan Kaufmann, San Mateo, California, 1992. Google ScholarDigital Library
- 5.J. Barwise. "On Mosehovakis closure ordinals". Journal of Symbolic Logic, 42:292-296, 1977.Google ScholarCross Ref
- 6.E. BSrger, E. Gr~lel, and Y. Gurevich. The classical decision problem. Springer, 1997.Google Scholar
- 7.P. Buneman, S. Davidson, G. Hillebrand, and D. Suciu. ".4. query language and optimization techniques for unstructured data". In Proc. A CM SIGMOD Inter. national Conf. on Management of Data, pp. 505-516, 1996. Google ScholarDigital Library
- 8.P. Buneman, W. Fan, and S. Weinstein. "Some undecidable implication problems for path constraints". Technical Report MS-CIS-97-14, Department of Computer and Information Science, University of Pennsylvania, 1997.Google Scholar
- 9.P. Buneman, W. Fan, and S. Weinstein. "The decidability of some restricted implication problems for path constraints". Technical Report MS-CIS-97-15, Department of Computer and Information Science, University of Pennsylvania, 1997.Google Scholar
- 10.P. Buneman, W. Fan, and S. Weinstein. "Path constraints in the presence of types". Technical Report MS- CIS-97-16, Department of Computer and Information Science, University of Pennsylvania, 1997.Google Scholar
- 11.tL G. G. Cattell (ed.). The object-oriented standard: ODMG-93 (Release 1.2). Morgan Kaufmann, San Marco, California, 1996.Google Scholar
- 12.E. Gr~clel, P. Kolaitis, and M. Vardi. "On the decision problem for two-variable fn~t-order logic". Bulletin of Symbolic Logic, 3(1): 53-69, 1997.Google ScholarCross Ref
- 13.C. Lamb, G. Landis, J. Orenstein, and D. Weinreb. "The ObjeetStore Database system". Comm. A CM~ 34(10): 51-63, October 1991. Google ScholarDigital Library
- 14.J. Thierry-Mieg and It. Dttrbin. "Syntactic definitions for the ACEDB data base manager". Technical Report MRC-LMB :~x.92, MRC Laboratory for Molecular Biology, Cambridge, CB2 2QH, UK, 1992.Google Scholar
- 15.H. Wang. "Dominoes and the VSV-case of the decision problem". In Proc. Syrup. on Mathematical Theory of Automata, Brooklyn Polytechnic Institute, pp. 23-55, 1962.Google Scholar
Index Terms
- Path constraints on semistructured and structured data
Recommendations
Path Constraints in Semistructured Databases
Special issue on the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on principles of database systemsWe investigate a class of path constraints that is of interest in connection with both semistructured and structured data. In standard database systems, constraints are typically expressed as part of the schema, but in semistructured data there is no ...
Path constraints in semistructured data
We consider semistructured data as multirooted edge-labelled directed graphs, and path inclusion constraints on these graphs. A path inclusion constraint p@?q is satisfied by a semistructured data if any node reached by the regular query p is also ...
Ordering and Path Constraints over Semistructured Data
Constraints are a valuable tool for managing information. Feature constraints have been used for describing records in constraint programming (Aït-Kaci and Podelski, 1993; Smolka and Treinen, 1994) and record like structures in computational linguistics ...
Comments