Sciweavers

10088 search results - page 1954 / 2018
» Queries and Computation on the Web
Sort
View
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
14 years 9 months ago
Lower bounds for dynamic connectivity
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...
Mihai Patrascu, Erik D. Demaine
OSDI
2006
ACM
14 years 9 months ago
Flight Data Recorder: Monitoring Persistent-State Interactions to Improve Systems Management
Mismanagement of the persistent state of a system--all the executable files, configuration settings and other data that govern how a system functions--causes reliability problems,...
Chad Verbowski, Emre Kiciman, Arunvijay Kumar, Bra...
ICALP
2009
Springer
14 years 9 months ago
Dynamic Succinct Ordered Trees
Abstract. We study the problem of maintaining a dynamic tree succinctly, in 2n + o(n) bits, under updates of the following form: insertion or deletion of a leaf, insertion of a nod...
Arash Farzan, J. Ian Munro
VLDB
2003
ACM
147views Database» more  VLDB 2003»
14 years 9 months ago
RE-tree: an efficient index structure for regular expressions
Due to their expressive power, Regular Expressions (REs) are quickly becoming an integral part of language specifications for several important application scenarios. Many of thes...
Chee Yong Chan, Minos N. Garofalakis, Rajeev Rasto...
SIGMOD
2008
ACM
191views Database» more  SIGMOD 2008»
14 years 9 months ago
Efficient aggregation for graph summarization
Graphs are widely used to model real world objects and their relationships, and large graph datasets are common in many application domains. To understand the underlying character...
Yuanyuan Tian, Richard A. Hankins, Jignesh M. Pate...
« Prev « First page 1954 / 2018 Last » Next »