Sciweavers

707 search results - page 118 / 142
» Processing queries on tree-structured data efficiently
Sort
View
ICDE
2008
IEEE
130views Database» more  ICDE 2008»
14 years 10 months ago
A Sampling-Based Approach to Information Recovery
There has been a recent resurgence of interest in research on noisy and incomplete data. Many applications require information to be recovered from such data. For example, in sens...
Junyi Xie, Jun Yang 0001, Yuguo Chen, Haixun Wang,...
ADMA
2008
Springer
147views Data Mining» more  ADMA 2008»
14 years 3 months ago
Mining Supplemental Frequent Patterns
The process of resource distribution and load balance of a distributed P2P network can be described as the process of mining Supplement Frequent Patterns (SFPs) from query transact...
Yintian Liu, Yingming Liu, Tao Zeng, Kaikuo Xu, Ro...
VLDB
2007
ACM
191views Database» more  VLDB 2007»
14 years 8 months ago
Multidimensional reverse k NN search
Given a multidimensional point q, a reverse k nearest neighbor (RkNN) query retrieves all the data points that have q as one of their k nearest neighbors. Existing methods for proc...
Yufei Tao, Dimitris Papadias, Xiang Lian, Xiaokui ...
SIGMOD
2007
ACM
167views Database» more  SIGMOD 2007»
14 years 8 months ago
Data currency in replicated DHTs
Distributed Hash Tables (DHTs) provide a scalable solution for data sharing in P2P systems. To ensure high data availability, DHTs typically rely on data replication, yet without ...
Reza Akbarinia, Esther Pacitti, Patrick Valduriez
PODS
2006
ACM
137views Database» more  PODS 2006»
14 years 8 months ago
Data exchange: computing cores in polynomial time
Data exchange deals with inserting data from one database into another database having a different schema. We study and solve a central computational problem of data exchange, nam...
Georg Gottlob, Alan Nash