221 search results - page 9 / 45 » Random Indexing K-tree |
PVLDB
2010
14 years 8 months ago
2010
Given a large directed graph, rapidly answering reachability queries between source and target nodes is an important problem. Existing methods for reachability trade-off indexing ...
DCC
2010
IEEE
15 years 4 months ago
2010
IEEE
We introduce an alternative Lempel-Ziv text parsing, LZ-End, that converges to the entropy and in practice gets very close to LZ77. LZ-End forces sources to finish at the end of ...
CIKM
2009
Springer
15 years 4 months ago
2009
Springer
This paper presents Dynamic IPL B+ -tree (d-IPL in short) as a B+ -tree index variant for flash-based storage systems. The d-IPL B+ -tree adopts a dynamic In-Page Logging (IPL) s...
ICDE
2008
IEEE
15 years 4 months ago
2008
IEEE
Personalized PageRank, related to random walks with restarts and conductance in resistive networks, is a frequent search paradigm for graph-structured databases. While efficient ba...
116
click to vote
ERSHOV
2009
Springer
15 years 1 months ago
2009
Springer
Abstract. Searching in metric spaces is a very active field since it offers methods for indexing and searching by similarity in collections of unstructured data. These methods sele...