Sciweavers

2853 search results - page 310 / 571
» On the Efficiency of Provenance Queries
Sort
View
285
Voted
ICDE
2005
IEEE
149views Database» more  ICDE 2005»
16 years 8 months ago
Change Tolerant Indexing for Constantly Evolving Data
Index structures are designed to optimize search performance, while at the same time supporting efficient data updates. Although not explicit, existing index structures are typica...
Reynold Cheng, Yuni Xia, Sunil Prabhakar, Rahul Sh...
VLDB
2005
ACM
177views Database» more  VLDB 2005»
16 years 6 months ago
Indexing mobile objects using dual transformations
With the recent advances in wireless networks, embedded systems and GPS technology, databases that manage the location of moving objects have received increased interest. In this ...
George Kollios, Dimitris Papadopoulos, Dimitrios G...
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
16 years 6 months ago
Progressive and selective merge: computing top-k with ad-hoc ranking functions
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
Dong Xin, Jiawei Han, Kevin Chen-Chuan Chang
ICDE
2008
IEEE
168views Database» more  ICDE 2008»
16 years 1 months ago
Index Design for Dynamic Personalized PageRank
Personalized PageRank, related to random walks with restarts and conductance in resistive networks, is a frequent search paradigm for graph-structured databases. While efficient ba...
Amit Pathak, Soumen Chakrabarti, Manish S. Gupta
WAIM
2004
Springer
16 years 20 hour ago
DHT Based Searching Improved by Sliding Window
Efficient full-text searching is a big challenge in Peer-to-Peer (P2P) system. Recently, Distributed Hash Table (DHT) becomes one of the reliable communication schemes for P2P. Som...
Shen Huang, Gui-Rong Xue, Xing Zhu, Yan-Feng Ge, Y...