13041 search results - page 2417 / 2609 » Simulating space and time |
166
click to vote
ICALP
2009
Springer
16 years 6 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...
278
click to vote
VLDB
2007
ACM
16 years 6 months ago
2007
ACM
Given a set of model graphs D and a query graph q, containment search aims to find all model graphs g D such that q contains g (q g). Due to the wide adoption of graph models, f...
245
click to vote
SIGMOD
2008
ACM
16 years 6 months ago
2008
ACM
Motivated by the fact that XML is increasingly being used in distributed applications, we propose building a cooperative caching scheme for XML documents. Our scheme allows sharin...
246
click to vote
SIGMOD
2008
ACM
16 years 6 months ago
2008
ACM
Today's query processing engines do not take advantage of the multiple occurrences of a relation in a query to improve performance. Instead, each instance is treated as a dis...
181
click to vote
SIGMOD
2005
ACM
16 years 6 months ago
2005
ACM
We consider the problem of joining data streams using limited cache memory, with the goal of producing as many result tuples as possible from the cache. Many cache replacement heu...