Sciweavers

45 search results - page 6 / 9
» tkde 2002
Sort
View
77
Voted
TKDE
2002
104views more  TKDE 2002»
14 years 12 months ago
The Presumed-Either Two-Phase Commit Protocol
This paper describes the presumed-either two-phase commit protocol. Presumed-either exploits log piggybacking to reduce the cost of committing transactions. If timely piggybacking ...
Gopi K. Attaluri, Kenneth Salem
102
Voted
TKDE
2002
133views more  TKDE 2002»
14 years 12 months ago
Binary Rule Generation via Hamming Clustering
The generation of a set of rules underlying a classification problem is performed by applying a new algorithm, called Hamming Clustering (HC). It reconstructs the and-or expressio...
Marco Muselli, Diego Liberati
TKDE
2002
127views more  TKDE 2002»
14 years 12 months ago
Efficient Join-Index-Based Spatial-Join Processing: A Clustering Approach
A join-index is a data structure used for processing join queries in databases. Join-indices use precomputation techniques to speed up online query processing and are useful for da...
Shashi Shekhar, Chang-Tien Lu, Sanjay Chawla, Siva...
TKDE
2002
124views more  TKDE 2002»
14 years 12 months ago
Clustering for Approximate Similarity Search in High-Dimensional Spaces
In this paper we present a clustering and indexing paradigm called Clindex for high-dimensional search spaces. The scheme is designed for approximate similarity searches, where on...
Chen Li, Edward Y. Chang, Hector Garcia-Molina, Gi...
97
Voted
TKDE
2002
74views more  TKDE 2002»
14 years 12 months ago
Specifying and Enforcing Association Semantics via ORN in the Presence of Association Cycles
Object Relationship Notation (ORN) is a declarative scheme that allows a variety of common relationship types to be conveniently specified to a Database Management System (DBMS), t...
Bryon K. Ehlmann, Gregory A. Riccardi, Naphtali Ri...