Sciweavers

3244 search results - page 557 / 649
» On convex complexity measures
Sort
View
SIGMOD
2007
ACM
136views Database» more  SIGMOD 2007»
16 years 6 months ago
Progressive optimization in a shared-nothing parallel database
Commercial enterprise data warehouses are typically implemented on parallel databases due to the inherent scalability and performance limitation of a serial architecture. Queries ...
Wook-Shin Han, Jack Ng, Volker Markl, Holger Kache...
ICDE
2010
IEEE
371views Database» more  ICDE 2010»
16 years 6 months ago
TASM: Top-k Approximate Subtree Matching
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
Nikolaus Augsten, Denilson Barbosa, Michael H. B&o...
SDM
2009
SIAM
180views Data Mining» more  SDM 2009»
16 years 3 months ago
Structure and Dynamics of Research Collaboration in Computer Science.
Complex systems exhibit emergent patterns of behavior at different levels of organization. Powerful network analysis methods, developed in physics and social sciences, have been s...
Andre Nash, Christian Bird, Earl T. Barr, Premkuma...
SOSP
2005
ACM
16 years 3 months ago
IRON file systems
Commodity file systems trust disks to either work or fail completely, yet modern disks exhibit more complex failure modes. We suggest a new fail-partial failure model for disks, ...
Vijayan Prabhakaran, Lakshmi N. Bairavasundaram, N...
SOSP
2007
ACM
16 years 3 months ago
AjaxScope: a platform for remotely monitoring the client-side behavior of web 2.0 applications
The rise of the software-as-a-service paradigm has led to the development of a new breed of sophisticated, interactive applications often called Web 2.0. While web applications ha...
Emre Kiciman, V. Benjamin Livshits