Sciweavers

197 search results - page 9 / 40
» Efficiently approximating query optimizer plan diagrams
Sort
View
TVCG
2008
125views more  TVCG 2008»
13 years 7 months ago
Generic Remeshing of 3D Triangular Meshes with Metric-Dependent Discrete Voronoi Diagrams
In this paper, we propose a generic framework for 3D surface remeshing. Based on a metric-driven Discrete Voronoi Diagram construction, our output is an optimized 3D triangular mes...
Sébastien Valette, Jean-Marc Chassery, R&ea...
SIGMOD
2007
ACM
219views Database» more  SIGMOD 2007»
14 years 7 months ago
Efficient exploitation of similar subexpressions for query processing
Complex queries often contain common or similar subexpressions, either within a single query or among multiple queries submitted as a batch. If so, query execution time can be imp...
Jingren Zhou, Johann Christoph Freytag, Per-Å...
ICDE
2009
IEEE
101views Database» more  ICDE 2009»
14 years 9 months ago
Power Hints for Query Optimization
Commercial database systems expose query hints to address situations in which the optimizer chooses a poor plan for a given query. However, current query hints are not flexible eno...
Nicolas Bruno, Surajit Chaudhuri, Ravishankar Rama...
TPDS
2008
120views more  TPDS 2008»
13 years 7 months ago
A New Storage Scheme for Approximate Location Queries in Object-Tracking Sensor Networks
Energy efficiency is one of the most critical issues in the design of wireless sensor networks. Observing that many sensor applications for object tracking can tolerate a certain d...
Jianliang Xu, Xueyan Tang, Wang-Chien Lee
EDBT
2008
ACM
159views Database» more  EDBT 2008»
14 years 7 months ago
Automaton in or out: run-time plan optimization for XML stream processing
Many systems such as Tukwila and YFilter combine automaton and algebra techniques to process queries over tokenized XML streams. Typically in this architecture, an automaton is fi...
Hong Su, Elke A. Rundensteiner, Murali Mani