Sciweavers

302 search results - page 9 / 61
» Keyword search on external memory data graphs
Sort
View
SIGMOD
2001
ACM
193views Database» more  SIGMOD 2001»
15 years 12 months ago
Epsilon Grid Order: An Algorithm for the Similarity Join on Massive High-Dimensional Data
The similarity join is an important database primitive which has been successfully applied to speed up applications such as similarity search, data analysis and data mining. The s...
Christian Böhm, Bernhard Braunmüller, Fl...
145
Voted
CIKM
2009
Springer
15 years 4 months ago
iMecho: an associative memory based desktop search system
Traditional desktop search engines only support keyword based search that needs exact keyword matching to find resources. However, users generally have a vague picture of what is...
Jidong Chen, Hang Guo, Wentao Wu, Wei Wang 0009
GIR
2006
ACM
15 years 5 months ago
A Location Data Annotation System for Personal Photograph Collections: Evaluation of a Searching and Browsing Tool
Abstract Categories and Subject Descriptors: H.3.3 Information Search and Retrieval: Clustering and Search Process. General Terms: Algorithms, Design, Human Factors. Keywords. Epis...
Chufeng Chen, Michael P. Oakes, John Tait
PPOPP
2012
ACM
13 years 7 months ago
Massively parallel breadth first search using a tree-structured memory model
Analysis of massive graphs has emerged as an important area for massively parallel computation. In this paper, it is shown how the Fresh Breeze trees-of-chunks memory model may be...
Tom St. John, Jack B. Dennis, Guang R. Gao
CIKM
2009
Springer
15 years 3 months ago
Suffix trees for very large genomic sequences
A suffix tree is a fundamental data structure for string searching algorithms. Unfortunately, when it comes to the use of suffix trees in real-life applications, the current metho...
Marina Barsky, Ulrike Stege, Alex Thomo, Chris Upt...