Sciweavers

302 search results - page 16 / 61
» Keyword search on external memory data graphs
Sort
View
WWW
2007
ACM
16 years 13 days ago
GigaHash: scalable minimal perfect hashing for billions of urls
A minimal perfect function maps a static set of keys on to the range of integers {0,1,2, ... , - 1}. We present a scalable high performance algorithm based on random graphs for ...
Kumar Chellapilla, Anton Mityagin, Denis Xavier Ch...
ERCIMDL
2004
Springer
180views Education» more  ERCIMDL 2004»
15 years 5 months ago
Next Generation Search Interfaces - Interactive Data Exploration and Hypothesis Formulation
To date, the majority of Web search engines have provided simple keyword search interfaces that present the results as a ranked list of hyperlinks. More recently researchers have b...
Jane Hunter, Katya Falkovych, Suzanne Little
CIKM
2005
Springer
15 years 5 months ago
Exact match search in sequence data using suffix trees
We study suitable indexing techniques to support efficient exact match search in large biological sequence databases. We propose a suffix tree (ST) representation, called STA-DF, ...
Mihail Halachev, Nematollaah Shiri, Anand Thamildu...
SIGIR
2006
ACM
15 years 5 months ago
Contextual search and name disambiguation in email using graphs
Similarity measures for text have historically been an important tool for solving information retrieval problems. In many interesting settings, however, documents are often closel...
Einat Minkov, William W. Cohen, Andrew Y. Ng
SODA
2008
ACM
143views Algorithms» more  SODA 2008»
15 years 1 months ago
Dynamic optimality for skip lists and B-trees
Sleator and Tarjan [39] conjectured that splay trees are dynamically optimal binary search trees (BST). In this context, we study the skip list data structure introduced by Pugh [...
Prosenjit Bose, Karim Douïeb, Stefan Langerma...