Sciweavers

333 search results - page 61 / 67
» Query Optimization Using Local Completeness
Sort
View
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
14 years 8 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
DLOG
2010
13 years 5 months ago
TBox Classification in Parallel: Design and First Evaluation
Abstract. One of the most frequently used inference services of description logic reasoners classifies all named classes of OWL ontologies into a subsumption hierarchy. Due to emer...
Mina Aslani, Volker Haarslev
CIKM
2008
Springer
13 years 9 months ago
Modeling LSH for performance tuning
Although Locality-Sensitive Hashing (LSH) is a promising approach to similarity search in high-dimensional spaces, it has not been considered practical partly because its search q...
Wei Dong, Zhe Wang, William Josephson, Moses Chari...
ICDE
2011
IEEE
265views Database» more  ICDE 2011»
12 years 11 months ago
RAFTing MapReduce: Fast recovery on the RAFT
MapReduce is a computing paradigm that has gained a lot of popularity as it allows non-expert users to easily run complex analytical tasks at very large-scale. At such scale, task...
Jorge-Arnulfo Quiané-Ruiz, Christoph Pinkel...
EENERGY
2010
13 years 11 months ago
Energy-aware traffic engineering
Energy consumption of the Internet is already substantial and it is likely to increase as operators deploy faster equipment to handle popular bandwidthintensive services, such as ...
Nedeljko Vasic, Dejan Kostic