6615 search results - page 39 / 1323 » Indexing Multiple Sets |
101
click to vote
SIGMOD
2004
ACM
15 years 12 months ago
2004
ACM
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...
105
click to vote
CP
2006
Springer
15 years 3 months ago
2006
Springer
Ideally, programming propagators as implementations of constraints should be an entirely declarative specification process for a large class of constraints: a high-level declarativ...
174
click to vote
ICDE
2003
IEEE
16 years 1 months ago
2003
IEEE
Data mining applications analyze large collections of set data and high dimensional categorical data. Search on these data types is not restricted to the classic problems of minin...
CIKM
2009
Springer
15 years 6 months ago
2009
Springer
We study the problem of creating highly compressed fulltext index structures for versioned document collections, that is, collections that contain multiple versions of each docume...
175
click to vote
ICDE
2008
IEEE
16 years 1 months ago
2008
IEEE
XML database systems are expected to handle increasingly complex queries over increasingly large and highly structured XML databases. An important problem that needs to be solved ...