𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Algebraic query optimization for distributed top-k queries

✍ Scribed by Neumann, Thomas ;Michel, Sebastian

Publisher
Springer-Verlag
Year
2007
Tongue
German
Weight
728 KB
Volume
21
Category
Article
ISSN
0178-3564

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Algebraic rewritings for optimizing regu
Algebraic rewritings for optimizing regular path queries
✍ GΓΆsta Grahne; Alex Thomo πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 189 KB

Rewriting queries using views is a powerful technique that has applications in query optimization, data integration, data warehousing, etc. Query rewriting in relational databases is by now rather well investigated. However, in the framework of semistructured data the problem of rewriting has receiv

Algebras for Querying Text Regions: Expr
Algebras for Querying Text Regions: Expressive Power and Optimization
✍ Mariano P. Consens; Tova Milo πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 762 KB

There is a significant amount of interest in combining and extending database and information retrieval technologies to manage textual data. The challenge is becoming more relevant due to increased availability of documents in digital form. Document data has a natural hierarchical structure, which m

On query optimization in a temporal SPC
On query optimization in a temporal SPC algebra
✍ Jef Wijsen; Alexis BΓ¨s πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 373 KB

Tuples of a temporal relation are equipped with a valid time period. A simple extension of the selectionprojection-cross product (SPC) algebra for temporal relations is defined, which conforms to primitives in existing temporal query languages. In particular, temporal projection involves coalescing

Asymptotic distributions for partial mat
Asymptotic distributions for partial match queries in K-d trees
✍ Ralph Neininger πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 229 KB

The distributional performance of the cost of a partial match query is investigated in some sorts of K-d trees. The trees under consideration are Bentley's K-d tree, the locally balanced K-d-t tree, and the random relaxed K-d tree. For each of these trees it is proved that in the uniform probabilist