69 search results - page 9 / 14 » Merkle Tree Traversal in Log Space and Time |
ICDT
2009
ACM
14 years 8 months ago
2009
ACM
Graph-theoretic aggregation problems have been considered both in OLAP (grid graph) and XML (tree). This paper gives new results for MIN aggregation in a tree, where we want the M...
SPIRE
2005
Springer
14 years 1 months ago
2005
Springer
Output-sensitive data structures result from preprocessing n items and are capable of reporting the items satisfying an on-line query in O(t(n) + ℓ) time, where t(n) is the cost ...
FOCS
2009
IEEE
13 years 11 months ago
2009
IEEE
Given a set D = {d1, d2, ..., dD} of D strings of total length n, our task is to report the "most relevant" strings for a given query pattern P. This involves somewhat mo...
TALG
2008
13 years 7 months ago
2008
We present simple, fully dynamic and kinetic data structures, which are variants of a dynamic two-dimensional range tree, for maintaining the closest pair and all nearest neighbors...
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
Abstract. We consider the succinct representation of ordinal and cardinal trees on the RAM with logarithmic word size. Given a tree T, our representations support the following ope...