1567 search results - page 6 / 314 » Compressing Relations and Indexes |
SIGMOD
1999
ACM
14 years 2 hour ago
1999
ACM
The database query optimizer requires the estimation of the query selectivity to find the most efficient access plan. For queries referencing multiple attributes from the same rel...
DEXAW
2008
IEEE
14 years 2 months ago
2008
IEEE
— One of the critical issues in search engines is the size of search indexes: as the number of documents handled by an engine increases, the search must preserve its efficiency,...
ICDE
1995
IEEE
14 years 9 months ago
1995
IEEE
Data compression is one way to alleviate the 1/0bottleneck problem faced by I/O-intensive applications such as databases. However, this approach is not widely used because of the ...
SSDBM
2010
IEEE
14 years 16 hour ago
2010
IEEE
Similarity search and similarity join on strings are important for applications such as duplicate detection, error detection, data cleansing, or comparison of biological sequences....
DBA
2004
13 years 9 months ago
2004
In order to guarantee efficient query processing together with industrial strength, spatial index structures have to be integrated into fully-fledged object-relational database ma...