4536 search results - page 69 / 908 » Contention-Sensitive Data Structures and Algorithms |
STOC
2009
ACM
14 years 9 months ago
2009
ACM
We prove lower bounds on the redundancy necessary to represent a set S of objects using a number of bits close to the information-theoretic minimum log2 |S|, while answering vario...
TKDE
2002
13 years 8 months ago
2002
Since WWW encourages hypertext and hypermedia document authoring (e.g. HTML or XML), Web authors tend to create documents that are composed of multiple pages connected with hyperl...
VLDB
2002
ACM
13 years 8 months ago
2002
ACM
Traditional indexes aim at optimizing the node accesses during query processing, which, however, does not necessarily minimize the total cost due to the possibly large number of r...
WEBDB
2004
Springer
14 years 2 months ago
2004
Springer
XML and semi-structured data is usually modeled using graph structures. Structural summaries, which have been proposed to speedup XML query processing have graph forms as well. Th...
KDD
2003
ACM
14 years 9 months ago
2003
ACM
Using visualization techniques to explore and understand high-dimensional data is an efficient way to combine human intelligence with the immense brute force computation power ava...