46 search results - page 6 / 10 » Efficient k-NN search on vertically decomposed data |
114
click to vote
WWW
2008
ACM
16 years 13 days ago
2008
ACM
Efficiently querying RDF [1] data is being an important factor in applying Semantic Web technologies to real-world applications. In this context, many efforts have been made to st...
WWW
2003
ACM
16 years 13 days ago
2003
ACM
In traditional peer-to-peer search networks, operations focus on properly labeled files such as music or video, and the actual search is often limited to text tags. The explosive ...
203
click to vote
ICDE
2001
IEEE
16 years 1 months ago
2001
IEEE
We present a new algorithm for mining maximal frequent itemsets from a transactional database. Our algorithm is especially efficient when the itemsets in the database are very lon...
101
click to vote
FOCS
1992
IEEE
15 years 3 months ago
1992
IEEE
We describe dynamic data structures for half-space range reporting and for maintaining the minima of a decomposable function. Using these data structures, we obtain efficient dyna...
101
click to vote
CIKM
1998
Springer
15 years 4 months ago
1998
Springer
In this paper we present SPADE, a new algorithm for fast discovery of Sequential Patterns. The existing solutions to this problem make repeated database scans, and use complex has...