1567 search results - page 154 / 314 » Compressing Relations and Indexes |
229
click to vote
ICDE
1999
IEEE
16 years 6 months ago
1999
IEEE
Most operations of the relational algebra or SQL require a sorted stream of tuples for efficient processing. Therefore, processing complex relational queries relies on efficient a...
197
click to vote
SSDBM
2002
IEEE
15 years 10 months ago
2002
IEEE
The efficient management of interval data represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tree1 ), an effi...
164
click to vote
CVPR
2008
IEEE
16 years 7 months ago
2008
IEEE
For content level access, very often database needs the query as a sample image. However, the image may contain private information and hence the user does not wish to reveal the ...
161
click to vote
KDD
2008
ACM
16 years 5 months ago
2008
ACM
In many multiclass learning scenarios, the number of classes is relatively large (thousands,...), or the space and time efficiency of the learning system can be crucial. We invest...
159
click to vote
SIGMOD
2004
ACM
16 years 5 months ago
2004
ACM
In addition to indexes and materialized views, horizontal and vertical partitioning are important aspects of physical design in a relational database system that significantly imp...