Sciweavers

5221 search results - page 286 / 1045
» An On-line Problem Database
Sort
View
VLDB
2004
ACM
124views Database» more  VLDB 2004»
15 years 12 months ago
Containment of Nested XML Queries
Query containment is the most fundamental relationship between a pair of database queries: a query Q is said to be contained in a query Q if the answer for Q is always a subset of...
Xin Dong, Alon Y. Halevy, Igor Tatarinov
PODS
2010
ACM
207views Database» more  PODS 2010»
15 years 11 months ago
Understanding cardinality estimation using entropy maximization
Cardinality estimation is the problem of estimating the number of tuples returned by a query; it is a fundamentally important task in data management, used in query optimization, ...
Christopher Ré, Dan Suciu
STOC
1998
ACM
190views Algorithms» more  STOC 1998»
15 years 11 months ago
Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vecto...
Eyal Kushilevitz, Rafail Ostrovsky, Yuval Rabani
VLDB
1994
ACM
114views Database» more  VLDB 1994»
15 years 10 months ago
On Index Selection Schemes for Nested Object Hierarchies
In this paper we address the problem of devising a set of indexes for a nested object hierarchy in an object-oriented database to improve the overall system performance. It is not...
Sudarshan S. Chawathe, Ming-Syan Chen, Philip S. Y...
WEBDB
2000
Springer
136views Database» more  WEBDB 2000»
15 years 10 months ago
An Optimization Technique for Answering Regular Path Queries
Rewriting queries using views is a powerful technique that has applications in data integration, data warehousing and query optimization. Query rewriting in relational databases i...
Gösta Grahne, Alex Thomo