Sciweavers

VLDB
1998
ACM
120views Database» more  VLDB 1998»
13 years 11 months ago
Algorithms for Querying by Spatial Structure
: Structural queries constitute a special form of content-basedretrieval where the user specifiesa set of spatial constraints among query variables and asks for all configurations ...
Dimitris Papadias, Nikos Mamoulis, Vasilis Delis
VLDB
1998
ACM
131views Database» more  VLDB 1998»
13 years 11 months ago
An Asynchronous Avoidance-Based Cache Consistency Algorithm for Client Caching DBMSs
We present a new client cache consistency algorithm for client caching database management systems. The algorithm, called Asynchronous Avoidance-based Cache Consistency (AACC), pr...
M. Tamer Özsu, Kaladhar Voruganti, Ronald C. ...
VLDB
1998
ACM
87views Database» more  VLDB 1998»
13 years 11 months ago
Fast High-Dimensional Data Search in Incomplete Databases
We propose and evaluate two indexing schemes for improving the efficiency of data retrieval in high-dimensional databases that are incomplete. These schemes are novel in that the ...
Beng Chin Ooi, Cheng Hian Goh, Kian-Lee Tan
VLDB
1998
ACM
138views Database» more  VLDB 1998»
13 years 11 months ago
TOPAZ: a Cost-Based, Rule-Driven, Multi-Phase Parallelizer
Currently the key problems of query optimization are extensibility imposed by object-relational technology, as well as query complexity caused by forthcoming applications, such as...
Clara Nippl, Bernhard Mitschang
VLDB
1998
ACM
134views Database» more  VLDB 1998»
13 years 11 months ago
Design, Implementation, and Performance of the LHAM Log-Structured History Data Access Method
Numerous applications such as stock market or medical information systems require that both historical and current data be logically integrated into a temporal database. The under...
Peter Muth, Patrick E. O'Neil, Achim Pick, Gerhard...
VLDB
1998
ACM
127views Database» more  VLDB 1998»
13 years 11 months ago
Algorithms for Mining Association Rules for Binary Segmentations of Huge Categorical Databases
We consider the problem of finding association rules that make nearly optimal binary segmentations of huge categorical databases. The optimality of segmentation is defined by an o...
Yasuhiko Morimoto, Takeshi Fukuda, Hirofumi Matsuz...
VLDB
1998
ACM
153views Database» more  VLDB 1998»
13 years 11 months ago
Small Materialized Aggregates: A Light Weight Index Structure for Data Warehousing
Small Materialized Aggregates (SMAs for short) are considered a highly flexible and versatile alternative for materialized data cubes. The basic idea is to compute many aggregate ...
Guido Moerkotte
VLDB
1998
ACM
102views Database» more  VLDB 1998»
13 years 11 months ago
Using Schema Matching to Simplify Heterogeneous Data Translation
A broad spectrum of data is available on the Web in distinct heterogeneous sources, and stored under different formats. As the number of systems that utilize this heterogeneous da...
Tova Milo, Sagit Zohar
VLDB
1998
ACM
91views Database» more  VLDB 1998»
13 years 11 months ago
Determining Text Databases to Search in the Internet
Text data in the Internet can be partitioned into many databases naturally. Efficient retrieval of desired data can be achieved if we can accurately predict the usefulness of each...
Weiyi Meng, King-Lup Liu, Clement T. Yu, Xiaodong ...
VLDB
1998
ACM
76views Database» more  VLDB 1998»
13 years 11 months ago
Querying Continuous Time Sequences
Ling Lin, Tore Risch