Sciweavers

96 search results - page 8 / 20
» Hardness of String Similarity Search and Other Indexing Prob...
Sort
View
INFOCOM
2005
IEEE
15 years 3 months ago
Assisted peer-to-peer search with partial indexing
—In the past few years, peer-to-peer (P2P) networks have become a promising paradigm for building a wide variety of distributed systems and applications. The most popular P2P app...
Rongmei Zhang, Y. Charlie Hu
ICDE
2009
IEEE
152views Database» more  ICDE 2009»
15 years 11 months ago
Tree Indexing on Flash Disks
Abstract-- Large flash disks have become an attractive alternative to magnetic hard disks, due to their high random read performance, low energy consumption and other features. How...
Yinan Li, Bingsheng He, Qiong Luo, Ke Yi
SIGMOD
2002
ACM
219views Database» more  SIGMOD 2002»
15 years 9 months ago
Efficient k-NN search on vertically decomposed data
Applications like multimedia retrieval require efficient support for similarity search on large data collections. Yet, nearest neighbor search is a difficult problem in high dimen...
Arjen P. de Vries, Nikos Mamoulis, Niels Nes, Mart...
WWW
2006
ACM
15 years 3 months ago
Do not crawl in the DUST: different URLs with similar text
We consider the problem of dust: Different URLs with Similar Text. Such duplicate URLs are prevalent in web sites, as web server software often uses aliases and redirections, and...
Uri Schonfeld, Ziv Bar-Yossef, Idit Keidar
SIGMOD
2011
ACM
241views Database» more  SIGMOD 2011»
14 years 13 days ago
Neighborhood based fast graph search in large networks
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
Arijit Khan, Nan Li, Xifeng Yan, Ziyu Guan, Supriy...