Name
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. |
Year | DOI | Venue |
|---|---|---|
1996 | 10.1145/235968.233358 | SIGMOD Conference |
Keywords | Field | DocType |
query language,generalized path expression,object algebra,new operator,inefficient algorithm,query optimizer,new technique,user defined functions,query optimization,path expressions | Query optimization,Query language,Programming language,Computer science,Path expression,Theoretical computer science,User-defined function,Interrogation,Operator (computer programming),Rewriting,Database,Content based analysis | Conference |
Volume | Issue | ISBN |
25 | 2 | 0-89791-794-4 |
Citations | PageRank | References |
60 | 23.75 | 14 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Vassilis Christophides | 1 | 2523 | 355.35 |
| Sophie Cluet | 2 | 1602 | 636.58 |
| Guido Moerkotte | 3 | 2136 | 649.11 |