Sciweavers

508 search results - page 26 / 102
» Bringing Order to Query Optimization
Sort
View
COMGEO
2008
ACM
13 years 7 months ago
Lower bounds for expected-case planar point location
Given a planar polygonal subdivision S, the point location problem is to preprocess S into a data structure so that the cell of the subdivision that contains a given query point c...
Theocharis Malamatos
ICDCSW
2007
IEEE
14 years 2 months ago
Event Stream Processing with Out-of-Order Data Arrival
Complex event processing has become increasingly important in modern applications, ranging from supply chain management for RFID tracking to real-time intrusion detection. The goa...
Ming Li, Mo Liu, Luping Ding, Elke A. Rundensteine...
JGTOOLS
2006
199views more  JGTOOLS 2006»
13 years 7 months ago
Fast Approximation of High-Order Voronoi Diagrams and Distance Transforms on the GPU
We present a graphics hardware implementation of the tangent-plane algorithm for computing the kth-order Voronoi diagram of a set of point sites in image space. Correct and effici...
Ian Fischer, Craig Gotsman
VLDB
2001
ACM
190views Database» more  VLDB 2001»
14 years 3 days ago
LEO - DB2's LEarning Optimizer
Most modern DBMS optimizers rely upon a cost model to choose the best query execution plan (QEP) for any given query. Cost estimates are heavily dependent upon the optimizer’s e...
Michael Stillger, Guy M. Lohman, Volker Markl, Mok...
DASFAA
2006
IEEE
168views Database» more  DASFAA 2006»
14 years 1 months ago
PMJoin: Optimizing Distributed Multi-way Stream Joins by Stream Partitioning
Abstract. In emerging data stream applications, data sources are typically distributed. Evaluating multi-join queries over streams from different sources may incur large communica...
Yongluan Zhou, Ying Yan, Feng Yu, Aoying Zhou