19 search results - page 2 / 4 » Query-Based Indexing in Collaorative Search |
AINA
2009
IEEE
13 years 3 months ago
2009
IEEE
Searching very large collections can be costly in both computation and storage. To reduce this cost, recent research has focused on reducing the size (pruning) of the inverted ind...
DAWAK
2001
Springer
13 years 10 months ago
2001
Springer
Adaptable similarity queries based on quadratic form distance functions are widely popular in data mining applications, particularly for domains such as multimedia, CAD, molecular ...
JIIS
2002
13 years 5 months ago
2002
Adaptable similarity queries based on quadratic form distance functions are widely popular in data mining application domains including multimedia, CAD, molecular biology or medica...
CN
2010
13 years 5 months ago
2010
Distributed hash tables (DHTs) are very efficient for querying based on key lookups. However, building huge term indexes, as required for IR-style keyword search, poses a scalabil...
CIKM
2009
Springer
14 years 5 days ago
2009
Springer
In order to enable scalable querying of graph databases, intelligent selection of subgraphs to index is essential. An improved index can reduce response times for graph queries si...