Sciweavers

242 search results - page 20 / 49
» An Efficient Method for Indexing Now-relative Bitemporal dat...
Sort
View
CATA
1998
13 years 9 months ago
QVI: Query-based virtual index for distributed information retrieval
The large unstructured text collections demand full-text search capabilities from IR systems. Current systems typically allow users only to connect to a single database (or site) ...
Dong-gyu Kim, Sang-goo Lee
CVDB
2004
ACM
14 years 1 months ago
Nearest Neighbor Search on Multimedia Indexing Structures
Nearest Neighbor Search on Multimedia Indexing Structures Multimedia databases get larger and larger in our days, and this trend is expected to continue in the future. There are v...
Thomas Seidl
DEXA
2004
Springer
190views Database» more  DEXA 2004»
14 years 1 months ago
On Efficient and Effective Association Rule Mining from XML Data
: In this paper, we propose a framework, called XAR-Miner, for mining ARs from XML documents efficiently and effectively. In XAR-Miner, raw XML data are first transformed to either...
Ji Zhang, Tok Wang Ling, Robert M. Bruckner, A. Mi...
SIGMOD
2004
ACM
182views Database» more  SIGMOD 2004»
14 years 7 months ago
Efficient set joins on similarity predicates
In this paper we present an efficient, scalable and general algorithm for performing set joins on predicates involving various similarity measures like intersect size, Jaccard-coe...
Sunita Sarawagi, Alok Kirpal
SIGMOD
2002
ACM
219views Database» more  SIGMOD 2002»
14 years 7 months ago
Efficient k-NN search on vertically decomposed data
Applications like multimedia retrieval require efficient support for similarity search on large data collections. Yet, nearest neighbor search is a difficult problem in high dimen...
Arjen P. de Vries, Nikos Mamoulis, Niels Nes, Mart...