4536 search results - page 610 / 908 » Contention-Sensitive Data Structures and Algorithms |
180
click to vote
COMPGEOM
2005
ACM
15 years 8 months ago
2005
ACM
Let S be a set of n points moving on the real line. The kinetic sorting problem is to maintain a data structure on the set S that makes it possible to quickly generate a sorted li...
192
click to vote
ICDM
2009
IEEE
16 years 1 months ago
2009
IEEE
—Document networks, i.e., networks associated with text information, are becoming increasingly popular due to the ubiquity of Web documents, blogs, and various kinds of online da...
170
click to vote
DASFAA
2010
IEEE
16 years 1 months ago
2010
IEEE
Compression in column-oriented databases has been proven to offer both performance enhancements and reductions in storage consumption. This is especially true for read access as c...
212
click to vote
INTERACTION
2009
ACM
16 years 1 months ago
2009
ACM
DTD and its instance have been considered the standard for data representation and information exchange format on the current web. However, when coming to the next generation of w...
188
click to vote
DOLAP
2003
ACM
15 years 12 months ago
2003
ACM
The data cube operator exemplifies two of the most important aspects of OLAP queries: aggregation and dimension hierarchies. In earlier work we presented Dwarf, a highly compress...