Sciweavers

792 search results - page 43 / 159
» Computing Iceberg Queries Efficiently
Sort
View
IPPS
2006
IEEE
15 years 3 months ago
Ant-inspired query routing performance in dynamic peer-to-peer networks
P2P Networks are highly dynamic structures since their nodes – peer users keep joining and leaving continuously. In the paper, we study the effects of network change rates on qu...
Mojca Ciglaric, Tone Vidmar
CRYPTO
2008
Springer
75views Cryptology» more  CRYPTO 2008»
14 years 11 months ago
New Efficient Attacks on Statistical Disclosure Control Mechanisms
The goal of a statistical database is to provide statistics about a population while simultaneously protecting the privacy of the individual records in the database. The tension be...
Cynthia Dwork, Sergey Yekhanin
SIGMOD
2010
ACM
132views Database» more  SIGMOD 2010»
14 years 4 months ago
Durable top-k search in document archives
We propose and study a new ranking problem in versioned databases. Consider a database of versioned objects which have different valid instances along a history (e.g., documents i...
Leong Hou U, Nikos Mamoulis, Klaus Berberich, Srik...
DASFAA
2004
IEEE
138views Database» more  DASFAA 2004»
15 years 1 months ago
Counting Relaxed Twig Matches in a Tree
Abstract. We consider the problem of accurately estimating the number of approximate XML answers for a given query, and propose an efficient method that (1) accurately computes sel...
Dongwon Lee, Divesh Srivastava
ICDE
2006
IEEE
160views Database» more  ICDE 2006»
15 years 11 months ago
Surface k-NN Query Processing
A k-NN query finds the k nearest-neighbors of a given point from a point database. When it is sufficient to measure object distance using the Euclidian distance, the key to effici...
Ke Deng, Xiaofang Zhou, Heng Tao Shen, Kai Xu 0003...