Sciweavers

35 search results - page 6 / 7
» On the Integration of Structure Indexes and Inverted Lists
Sort
View
IPM
2006
167views more  IPM 2006»
13 years 4 months ago
Browsing mixed structured and unstructured data
Both structured and unstructured data, as well as structured data representing several different types of tuples, may be integrated into a single list for browsing or retrieval. D...
Robert M. Losee
CIDR
2003
147views Algorithms» more  CIDR 2003»
13 years 6 months ago
Sorting And Indexing With Partitioned B-Trees
Partitioning within a B-tree, based on an artificial leading key column and combined with online reorganization, can be exploited during external merge sort for accurate deep read...
Goetz Graefe
SIGIR
2005
ACM
13 years 10 months ago
Indexing emails and email threads for retrieval
Electronic mail poses a number of unusual challenges for the design of information retrieval systems and test collections, including informal expression, conversational structure,...
Yejun Wu, Douglas W. Oard
CIKM
2008
Springer
13 years 6 months ago
Dynamic faceted search for discovery-driven analysis
We propose a dynamic faceted search system for discoverydriven analysis on data with both textual content and structured attributes. From a keyword query, we want to dynamically s...
Debabrata Dash, Jun Rao, Nimrod Megiddo, Anastasia...
SIGMOD
2009
ACM
155views Database» more  SIGMOD 2009»
14 years 5 months ago
Efficient top-k algorithms for fuzzy search in string collections
An approximate search query on a collection of strings finds those strings in the collection that are similar to a given query string, where similarity is defined using a given si...
Rares Vernica, Chen Li