SIGMOD
1997
ACM
13 years 8 months ago
1997
ACM
The Partitioned Based Spatial-Merge Join (PBSM) of Patel and DeWitt and the Size Separation Spatial Join (S3 J) of Koudas and Sevcik are considered to be among the most efficient ...
SIGMOD
1997
ACM
13 years 8 months ago
1997
ACM
Computing multiple related group-bys and aggregates is one of the core operations of On-Line Analytical Processing (OLAP) applications. Recently, Gray et al. [GBLP95] proposed the...
SIGMOD
1997
ACM
13 years 8 months ago
1997
ACM
The Distributed Information Search COmponent (Disco) is a prototype heterogeneous distributed database that accesses underlying data sources. The Disco prototype currently focuses...
SIGMOD
1997
ACM
13 years 8 months ago
1997
ACM
We study similarity queries for time series data where similarity is defined in terms of a set of linear transformations on the Fourier series representation of a sequence. We ha...
SIGMOD
1997
ACM
13 years 8 months ago
1997
ACM
Data warehouses store materialized views over base data from external sources. Clients typically perform complex read-only queries on the views. The views are refreshed periodical...
SIGMOD
1997
ACM
13 years 8 months ago
1997
ACM
: The read-mostly environment of data warehousing makes it possible to use more complex indexes to speed up queries than in situations where concurrent updatesare present. The curr...
SIGMOD
1997
ACM
13 years 8 months ago
1997
ACM
Data warehouses contain large amounts of information, often collected from a variety of independent sources. Decision-support functions in a warehouse, such as on-line analytical ...
SIGMOD
1997
ACM
13 years 8 months ago
1997
ACM
SIGMOD
1997
ACM
13 years 8 months ago
1997
ACM
This paper presents general algorithms for concurrency control in tree-based access methods as well as a recovery protocol and a mechanism for ensuring repeatable read. The algori...
SIGMOD
1997
ACM
13 years 8 months ago
1997
ACM