136 search results - page 24 / 28 » Optimization and Dataflow Algorithms for Nested Tree Queries |
SODA
2010
ACM
14 years 4 months ago
2010
ACM
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
SIGMOD
2004
ACM
14 years 7 months ago
2004
ACM
Database system architectures are undergoing revolutionary changes. Most importantly, algorithms and data are being unified by integrating programming languages with the database ...
STOC
2004
ACM
14 years 7 months ago
2004
ACM
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
VLDB
2005
ACM
14 years 27 days ago
2005
ACM
Summarization of query results is an important problem for many OLAP applications. The Minimum Description Length principle has been applied in various studies to provide summarie...
TJS
2008
13 years 7 months ago
2008
XML is a flexible and powerful tool that enables information and security sharing in heterogeneous environments. Scalable technologies are needed to effectively manage the growing...