332 search results - page 28 / 67 » Space Complexity vs. Query Complexity |
IJCGA
2007
13 years 9 months ago
2007
Given two sets A and B of m non-intersecting line segments in the plane, we show how to compute in O(m log m) time a data structure that uses O(m) space and allows to answer the fo...
SIGMOD
2006
ACM
14 years 10 months ago
2006
ACM
Modern scientific applications consume massive volumes of data produced by computer simulations. Such applications require new data management capabilities in order to scale to te...
STOC
2007
ACM
14 years 10 months ago
2007
ACM
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...
NLDB
2011
Springer
13 years 22 days ago
2011
Springer
Abstract. Linked Data brings the promise of incorporating a new dimension to the Web where the availability of Web-scale data can determine a paradigmatic transformation of the Web...
SIGMOD
2003
ACM
14 years 10 months ago
2003
ACM
A query optimizer compares alternative plans in its search space to find the best plan for a given query. Depending on the search space and the enumeration algorithm, optimizers v...