958 search results - page 40 / 192 » Efficient data structures for range-aggregate queries on tre... |
117
Voted
JFP
2006
15 years 13 days ago
2006
Pattern matching is an important operation in functional programs. So far, pattern matching has been investigated in the context of structured terms. This article presents an appr...
121
Voted
ASIACRYPT
2010
Springer
14 years 10 months ago
2010
Springer
We consider the problem of encrypting structured data (e.g., a web graph or a social network) in such a way that it can be efficiently and privately queried. For this purpose, we ...
123
click to vote
DEBU
2008
15 years 16 days ago
2008
In this paper, we describe the TIMBER XML database system implemented at University of Michigan. TIMBER was one of the first native XML database systems, designed from the ground ...
133
Voted
NJC
2006
15 years 12 days ago
2006
Regular tree queries (RTQs) are a class of queries considered especially relevant for the expressiveness and evaluation of XML query languages. The algorithms proposed so far for ...
100
Voted
EDBT
2004
ACM
16 years 18 days ago
2004
ACM
XML suffers from the major limitation of high redundancy. Even if compression can be beneficial for XML data, however, once compressed, the data can be seldom browsed and queried i...