Sciweavers

6974 search results - page 200 / 1395
» Querying Semi-Structured Data
Sort
View
TDM
2004
174views Database» more  TDM 2004»
13 years 9 months ago
Relational Approach to Logical Query Optimization of XPath
To be able to handle the ever growing volumes of XML documents, effective and efficient data management solutions are needed. Managing XML data in a relational DBMS has great pote...
Maurice van Keulen
ICDE
2004
IEEE
85views Database» more  ICDE 2004»
14 years 9 months ago
Selectivity Estimation for String Predicates: Overcoming the Underestimation Problem
Queries with (equality or LIKE) selection predicates over string attributes are widely used in relational databases. However, state-of-the-art techniques for estimating selectivit...
Surajit Chaudhuri, Venkatesh Ganti, Luis Gravano
SSD
1995
Springer
97views Database» more  SSD 1995»
13 years 11 months ago
Ranking in Spatial Databases
Abstract. An algorithm for ranking spatial objects according to increasing distance from a query object is introduced and analyzed. The algorithm makes use of a hierarchical spatia...
Gísli R. Hjaltason, Hanan Samet
SISAP
2008
IEEE
130views Data Mining» more  SISAP 2008»
14 years 2 months ago
The Many Facets of Approximate Similarity Search
In this article, we review the major paradigms for approximate similarity queries and propose a classification schema that easily allows existing approaches to be compared along ...
Marco Patella, Paolo Ciaccia
DEXA
2005
Springer
80views Database» more  DEXA 2005»
14 years 1 months ago
Optimizing I/O Costs of Multi-dimensional Queries Using Bitmap Indices
Bitmap indices are efficient data structures for processing complex, multi-dimensional queries in data warehouse applications and scientific data analysis. For high-cardinality at...
Doron Rotem, Kurt Stockinger, Kesheng Wu