Sciweavers

439 search results - page 21 / 88
» Unnesting Arbitrary Queries
Sort
View
PVLDB
2008
123views more  PVLDB 2008»
13 years 9 months ago
Dependable cardinality forecasts for XQuery
Though inevitable for effective cost-based query rewriting, the derivation of meaningful cardinality estimates has remained a notoriously hard problem in the context of XQuery. By...
Jens Teubner, Torsten Grust, Sebastian Maneth, She...
ICOODB
2010
129views Database» more  ICOODB 2010»
13 years 8 months ago
Solving ORM by MAGIC: MApping GeneratIon and Composition
Object-relational mapping (ORM) technologies have been proposed as a solution for the impedance mismatch problem between object-oriented applications and relational databases. Exis...
David Kensche, Christoph Quix, Xiang Li 0002, Sand...
SIGMETRICS
2012
ACM
247views Hardware» more  SIGMETRICS 2012»
12 years 11 days ago
A scalable architecture for maintaining packet latency measurements
Latency has become an important metric for network monitoring since the emergence of new latency-sensitive applications (e.g., algorithmic trading and high-performance computing)....
Myungjin Lee, Nick G. Duffield, Ramana Rao Kompell...
CGF
2004
113views more  CGF 2004»
13 years 9 months ago
Coherent Hierarchical Culling: Hardware Occlusion Queries Made Useful
We present a simple but powerful algorithm for optimizing the usage of hardware occlusion queries in arbitrary complex scenes. Our method minimizes the number of issued queries an...
Jirí Bittner, Michael Wimmer, Harald Piring...
DAWAK
2010
Springer
13 years 11 months ago
Discovery and Application of Functional Dependencies in Conjunctive Query Mining
Abstract. We present an algorithm for mining frequent queries in arbitrary relational databases, over which functional dependencies are assumed. Building upon previous results, we ...
Bart Goethals, Dominique Laurent, Wim Le Page