Sciweavers

VLDB
2000
ACM
106views Database» more  VLDB 2000»
13 years 11 months ago
Optimizing Queries on Compressed Bitmaps
Sihem Amer-Yahia, Theodore Johnson
VLDB
2000
ACM
177views Database» more  VLDB 2000»
13 years 11 months ago
The BT-tree: A Branched and Temporal Access Method
Temporal databases assume a single line of time evolution. In other words, they support timeevolving data. However there are applications which require the support of temporal dat...
Linan Jiang, Betty Salzberg, David B. Lomet, Manue...
VLDB
2000
ACM
109views Database» more  VLDB 2000»
13 years 11 months ago
The Challenge of Process Data Warehousing
Matthias Jarke, Thomas List, Jörg Köller
VLDB
2000
ACM
166views Database» more  VLDB 2000»
13 years 11 months ago
What Is the Nearest Neighbor in High Dimensional Spaces?
Nearest neighbor search in high dimensional spaces is an interesting and important problem which is relevant for a wide variety of novel database applications. As recent results s...
Alexander Hinneburg, Charu C. Aggarwal, Daniel A. ...
VLDB
2000
ACM
121views Database» more  VLDB 2000»
13 years 11 months ago
Optimizing Multi-Feature Queries for Image Databases
In digital libraries image retrieval queries can be based on the similarity of objects, using several feature attributes like shape, texture, color or text. Such multi-feature que...
Ulrich Güntzer, Wolf-Tilo Balke, Werner Kie&s...
VLDB
2000
ACM
91views Database» more  VLDB 2000»
13 years 11 months ago
OLAP++: Powerful and Easy-to-Use Federations of OLAP and Object Databases
Junmin Gu, Torben Bach Pedersen, Arie Shoshani
VLDB
2000
ACM
155views Database» more  VLDB 2000»
13 years 11 months ago
ICICLES: Self-Tuning Samples for Approximate Query Answering
Approximate query answering systems provide very fast alternatives to OLAP systems when applications are tolerant to small errors in query answers. Current sampling-based approach...
Venkatesh Ganti, Mong-Li Lee, Raghu Ramakrishnan
VLDB
2000
ACM
121views Database» more  VLDB 2000»
13 years 11 months ago
Fast Time Sequence Indexing for Arbitrary Lp Norms
Fast indexing in time sequence databases for similarity searching has attracted a lot of research recently. Most of the proposals, however, typically centered around the Euclidean...
Byoung-Kee Yi, Christos Faloutsos