332 search results - page 41 / 67 » Space Complexity vs. Query Complexity |
EDBT
2009
ACM
14 years 4 months ago
2009
ACM
Materialized views (MV) can significantly improve the query performance of relational databases. In this paper, we consider MVs to optimize complex scenarios where many heterogen...
ICDE
2005
IEEE
14 years 11 months ago
2005
IEEE
We present ViteX, an XPath processing system on XML streams with polynomial time complexity. ViteX uses a polynomial-space data structure to encode an exponential number of patter...
SDM
2012
SIAM
12 years 9 days ago
2012
SIAM
Many animals produce long sequences of vocalizations best described as “songs.” In some animals, such as crickets and frogs, these songs are relatively simple and repetitive c...
ECCC
2006
13 years 10 months ago
2006
A q query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such that one can probabilistically recover any bit xi of the message by querying only...
PVLDB
2008
13 years 9 months ago
2008
Given a parametrized n-dimensional SQL query template and a choice of query optimizer, a plan diagram is a color-coded pictorial enumeration of the execution plan choices of the o...