785 search results - page 82 / 157 » Binary Join Trees |
LICS
2005
IEEE
15 years 3 months ago
2005
IEEE
There are two main paradigms for querying semi structured data: regular path queries and XPath. The aim of this paper is to provide a synthesis between these two. This synthesis i...
COCO
2009
Springer
15 years 1 months ago
2009
Springer
Abstract--We study the 2-party randomized communication complexity of read-once AC0 formulae. For balanced AND-OR trees T with n inputs and depth d, we show that the communication ...
SIGMOD
2004
ACM
15 years 10 months ago
2004
ACM
Sovereign information sharing allows autonomous entities to compute queries across their databases in such a way that nothing apart from the result is revealed. We describe an imp...
TDM
2004
14 years 11 months ago
2004
This paper presents the advantages of combining multiple document representation schemes for query processing of XML queries on content and structure. We show how extending the Te...
ICIP
2005
IEEE
15 years 11 months ago
2005
IEEE
Recently, Chen et al. proposed a method for compressing color-quantized images that is based on a binary tree representation of colors and on context-based arithmetic coding with ...