Sciweavers

Share
ICDE
1996
IEEE
228views Database» more  ICDE 1996»
10 years 1 months ago
Similarity Indexing with the SS-tree
Eficient indezing of high dimensional feature vectors is important to allow visual information systems and a number other applications to scale up to large databases. In this pape...
David A. White, Ramesh Jain
ICDE
1996
IEEE
157views Database» more  ICDE 1996»
10 years 1 months ago
High Availability in Clustered Multimedia Servers
Clustered multimedia servers, consisting of interconnected nodes and disks, have been proposed for large scale servers, that are capable of supporting multiple concurrent streams ...
Renu Tewari, Daniel M. Dias, Rajat Mukherjee, Harr...
ICDE
1996
IEEE
120views Database» more  ICDE 1996»
10 years 1 months ago
Consistency and Performance of Concurrent Interactive Database Applications
Konstantinos Stathatos, Stephen Kelley, Nick Rouss...
ICDE
1996
IEEE
103views Database» more  ICDE 1996»
10 years 1 months ago
Using Partial Differencing for Efficient Monitoring of Deferred Complex Rule Conditions
This paper presents a difference calculus for determining changes to rule conditions in an active DBMS. The calculus has been used for implementing an algorithm to efficiently mon...
Martin Sköld, Tore Risch
ICDE
1996
IEEE
141views Database» more  ICDE 1996»
10 years 1 months ago
Data Replication in Mariposa
The Mariposa distributed data manager uses an economic model for managing the allocation of both storage objects and queries to servers. In this paper, we present extensions to th...
Jeff Sidell, Paul M. Aoki, Adam Sah, Carl Staelin,...
ICDE
1996
IEEE
155views Database» more  ICDE 1996»
10 years 1 months ago
DSDT: Durable Scripts Containing Database Transactions
DSDT is a programming tool for writing durable scripts which contain short ACID transactions as components. The context of the script is made durable by writing a log record whene...
Betty Salzberg, Dimitri Tombroff
ICDE
1996
IEEE
142views Database» more  ICDE 1996»
10 years 1 months ago
Approximate Queries and Representations for Large Data Sequences
Many new database application domains such as experimental sciences and medicine are characterized by large sequences as their main form of data. Using approximate representation ...
Hagit Shatkay, Stanley B. Zdonik
ICDE
1996
IEEE
178views Database» more  ICDE 1996»
10 years 1 months ago
Query Folding
Query folding refers to the activity of determining if and how a query can be answered using a given set of resources, which might be materialized views, cached results of previou...
Xiaolei Qian
books