6615 search results - page 85 / 1323 » Indexing Multiple Sets |
107
click to vote
SSDBM
2010
IEEE
14 years 9 months ago
2010
IEEE
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
123
click to vote
EDBT
2004
ACM
16 years 21 hour ago
2004
ACM
XML makes data flexible in representation and easily portable on the Web but it also substantially inflates data size as a consequence of using tags to describe data. Although many...
114
click to vote
HICSS
2010
IEEE
15 years 1 months ago
2010
IEEE
1 The latent semantic indexing (LSI) methodology for information retrieval applies the singular value decomposition to identify an eigensystem for a large matrix, in which cells re...
118
click to vote
SIGIR
2011
ACM
14 years 2 months ago
2011
ACM
Inverted indexes are the most fundamental and widely used data structures in information retrieval. For each unique word occurring in a document collection, the inverted index sto...
117
click to vote
CLUSTER
2005
IEEE
15 years 5 months ago
2005
IEEE
Data intensive applications on clusters often require requests quickly be sent to the node managing the desired data. In many applications, one must look through a sorted tree str...