Abiteboul, S. and Vianu, V. (1997) Regular Path Queries with Constraints. Technical Report. Stanford InfoLab. (Publication Note: Symposium on Principles of Database Systems (PODS 1997), May 12-14, 1997, Tucson, Arizona)
| BibTeX | DublinCore | EndNote | HTML |
![[img]](/style/images/fileicons/application_pdf.png)
| PDF 250Kb |
Abstract
The evaluation of path expression queries on semi-structured data in a distributed asynchronous environment is considered. The focus is on the use of local information expressed in the form of path constraints in the optimization of path expression queries. In particular, decidability and complexity results on the implication for path constraints are established.
| Item Type: | Techreport (Technical Report) | |
|---|---|---|
| Uncontrolled Keywords: | graph database, path query, constraint | |
| Subjects: | Computer Science > Semistructured Data | |
| Projects: | Lore | |
| Related URLs: | Project Homepage | http://infolab.stanford.edu/lore/ |
| ID Code: | 243 | |
| Deposited By: | Import Account | |
| Deposited On: | 25 Feb 2000 16:00 | |
| Last Modified: | 30 Dec 2008 09:39 |
Download statistics
Repository Staff Only: item control page
