Evaluating queries with generalized path expressions
- 1 June 1996
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGMOD Record
- Vol. 25 (2) , 413-422
- https://doi.org/10.1145/235968.233358
Abstract
In the past few years, query languages featuring generalized path expressions have been proposed. These languages allow the interrogation of both data and structure. They are powerful and essential for a number of applications. However, until now, their evaluation has relied on a rather naive and inefficient algorithm.In this paper, we extend an object algebra with two new operators and present some interesting rewriting techniques for queries featuring generalized path expressions. We also show how a query optimizer can integrate the new techniques.Keywords
This publication has 9 references indexed in Scilit:
- From structured documents to novel query facilitiesPublished by Association for Computing Machinery (ACM) ,1994
- Experiences building the open OODB query optimizerPublished by Association for Computing Machinery (ACM) ,1993
- Querying object-oriented databasesPublished by Association for Computing Machinery (ACM) ,1992
- Access support in object basesPublished by Association for Computing Machinery (ACM) ,1990
- Dynamic query evaluation plansPublished by Association for Computing Machinery (ACM) ,1989
- Extensible query processing in starburstPublished by Association for Computing Machinery (ACM) ,1989
- Grammar-like functional rules for representing query optimization alternativesPublished by Association for Computing Machinery (ACM) ,1988
- Query processing in a multimedia document systemACM Transactions on Information Systems, 1988
- The EXODUS optimizer generatorPublished by Association for Computing Machinery (ACM) ,1987