Searching for authors named Leonidas Fegaras – sorted by Relevance.
-
An Experimental Optimizer for OQL
- There is already a sizable body of proposals on OODB query optimization. One of the most challenging problems in this area is query unnesting, where the embedded query can take any form, including aggregation and universal quantification. Even though there is already a number of proposed techniques
- Cited by 12 (0 self) – Add To MetaCart
-
XQuery Processing with Relevance Ranking
- We are presenting a coherent framework for XQuery processing that incorporates IR-style approximate matching and allows the ordering of results by their relevance score. Our relevance ranking algorithm is based on both stem matching and term proximity. Our XQuery processor is stream-based, consi
- Cited by 3 (2 self) – Add To MetaCart
-
VOODOO: A Visual Object-Oriented Database Language for ODMG OQL
- This paper presents a simple and effective visual language to express ODMG OQL queries. The language is expressive enough to allow most types of query nesting, aggregation, universal and existential quantifications, group-by, and sorting, and at the same time is uniform and very simple to learn an
- Cited by 6 (1 self) – Add To MetaCart
-
The Joy of SAX
- Most current XQuery implementations require that all XML data reside in memory in one form or another before they start processing the data. This is unacceptable for large XML documents. The only event-based techniques that do not require the materialization of all data in memory are based on transd
- Cited by 7 (1 self) – Add To MetaCart
-
Fusion for Free!
- Program fusion techniques have long been proposed as an effective means of improving program performance and of eliminating unnecessary intermediate data structures. This paper proposes a new approach on program fusion that is based entirely on the type signatures of programs. First, for each functi
- Cited by 4 (0 self) – Add To MetaCart
-
Optimization of Large OODB Queries
- There is a number of OODB optimization techniques proposed recently, such as the translation of path expressions into joins and query unnesting, that may generate a large number of implicit joins even for simple queries. Unfortunately, most current commercial query optimizers are still based on the
- Cited by 1 (1 self) – Add To MetaCart
-
Using the Parametricity Theorem for Program Fusion
- Program fusion techniques have long been proposed as an effective means of improving program performance and of eliminating unnecessary intermediate data structures. This paper proposes a new approach on program fusion that is based entirely on the type signatures of programs. First, for each functi
- Cited by 2 (0 self) – Add To MetaCart
-
Optimizing Queries with Object Updates
- Object-oriented databases (OODBs) provide powerful data abstractions and modeling facilities but they usually lack a suitable framework for query processing and optimization. Even though there is an increasing number of recent proposals on OODB query optimization, only few of them are actually focus
- Cited by 7 (1 self) – Add To MetaCart
-
A New Heuristic for Optimizing Large Queries
- There is a number of OODB optimization techniques proposed recently, such as the translation of path expressions into joins and query unnesting, that may generate a large number of implicit joins even for simple queries. Unfortunately, most current commercial query optimizers are still based on the
- Cited by 10 (2 self) – Add To MetaCart
-
Efficient Optimization of Iterative Queries
- This paper presents a new query algebra based on fold iterations that facilitates database implementation. An algebraic normalization algorithm is introduced that reduces any program expressed in this algebra to a canonical form that generates no intermediate data structures and has no more nested i
- Cited by 13 (5 self) – Add To MetaCart

