Sciweavers

5344 search results - page 680 / 1069
» Privacy-Preserving Set Operations
Sort
View
ICDE
2007
IEEE
113views Database» more  ICDE 2007»
16 years 8 months ago
Reducing Order Enforcement Cost in Complex Query Plans
Algorithms that exploit sort orders are widely used to implement joins, grouping, duplicate elimination and other set operations. Query optimizers traditionally deal with sort ord...
Ravindra Guravannavar, S. Sudarshan
277
Voted
ICDE
2004
IEEE
148views Database» more  ICDE 2004»
16 years 8 months ago
Approximate Selection Queries over Imprecise Data
We examine the problem of evaluating selection queries over imprecisely represented objects. Such objects are used either because they are much smaller in size than the precise on...
Iosif Lazaridis, Sharad Mehrotra
ICDE
2003
IEEE
180views Database» more  ICDE 2003»
16 years 8 months ago
PeerDB: A P2P-based System for Distributed Data Sharing
In this paper, we present the design and evaluation of PeerDB, a peer-to-peer (P2P) distributed data sharing system. PeerDB distinguishes itself from existing P2P systems in sever...
Wee Siong Ng, Beng Chin Ooi, Kian-Lee Tan, Aoying ...
ICDE
2003
IEEE
114views Database» more  ICDE 2003»
16 years 8 months ago
Designing a Super-Peer Network
A super-peer is a node in a peer-to-peer network that operates both as a server to a set of clients, and as an equal in a network of super-peers. Super-peer networks strike a bala...
Beverly Yang, Hector Garcia-Molina
ICDE
2000
IEEE
168views Database» more  ICDE 2000»
16 years 8 months ago
PAC Nearest Neighbor Queries: Approximate and Controlled Search in High-Dimensional and Metric Spaces
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...
Paolo Ciaccia, Marco Patella