10457 search results - page 408 / 2092 » Data Mapping as Search |
177
click to vote
SISAP
2008
IEEE
16 years 1 months ago
2008
IEEE
Similarity search has been proved suitable for searching in very large collections of unstructured data objects. We are interested in efficient parallel query processing under si...
165
click to vote
ESA
1995
Springer
15 years 10 months ago
1995
Springer
We present an algorithm that minimizes the expected cost of indirect binary search for data with non-constant access costs, such as disk data. Indirect binary search means that sor...
292
click to vote
ICDE
2008
IEEE
16 years 8 months ago
2008
IEEE
With the explosion in the amount of semi-structured data users access and store, there is a need for complex search tools to retrieve often very heterogeneous data in a simple and ...
178
click to vote
CIKM
2009
Springer
16 years 1 months ago
2009
Springer
We propose a partitioning scheme for similarity search indexes that is called Maximal Metric Margin Partitioning (MMMP). MMMP divides the data on the basis of its distribution pat...
177
click to vote
IM
2007
15 years 6 months ago
2007
Today’s search engines are increasingly required to broaden their capabilities beyond free-text search. More complex features, such as supporting range constraints over numeric ...