Sciweavers

491 search results - page 26 / 99
» Optimizing Large OODB Queries
Sort
View
OOPSLA
1997
Springer
13 years 12 months ago
Query-Based Debugging of Object-Oriented Programs
Object relationships in modern software systems are becoming increasingly numerous and complex. Programmers who try to find violations of such relationships need new tools that al...
Raimondas Lencevicius, Urs Hölzle, Ambuj K. S...
ICDE
2006
IEEE
201views Database» more  ICDE 2006»
14 years 9 months ago
Counting at Large: Efficient Cardinality Estimation in Internet-Scale Data Networks
Counting in general, and estimating the cardinality of (multi-) sets in particular, is highly desirable for a large variety of applications, representing a foundational block for ...
Nikos Ntarmos, Peter Triantafillou, Gerhard Weikum
ECOOP
2004
Springer
14 years 1 months ago
Finding and Removing Performance Bottlenecks in Large Systems
Abstract. Software systems obey the 80/20 rule: aggressively optimizing a vital few execution paths yields large speedups. However, finding the vital few paths can be difficult, e...
Glenn Ammons, Jong-Deok Choi, Manish Gupta, Nikhil...
ICDE
2008
IEEE
127views Database» more  ICDE 2008»
14 years 9 months ago
Querying Data under Access Limitations
Data sources on the web are often accessible through web interfaces that present them as relational tables, but require certain attributes to be mandatorily selected, e.g., via a w...
Andrea Calì, Davide Martinenghi
DPD
2006
141views more  DPD 2006»
13 years 7 months ago
Efficient parallel processing of range queries through replicated declustering
A common technique used to minimize I/O in data intensive applications is data declustering over parallel servers. This technique involves distributing data among several disks so...
Hakan Ferhatosmanoglu, Ali Saman Tosun, Guadalupe ...