Sciweavers

907 search results - page 116 / 182
» Efficient Optimization of Iterative Queries
Sort
View
VLDB
1995
ACM
129views Database» more  VLDB 1995»
14 years 19 days ago
A Cost Model for Clustered Object-Oriented Databases
Query processing is one of the most, critical issues in Object-Oriented DBMSs. Extensible opt,imizers with efficient, search strategies require a cost model to select the most eff...
Georges Gardarin, Jean-Robert Gruser, Zhao-Hui Tan...
CCCG
2010
13 years 10 months ago
Connected dominating sets on dynamic geometric graphs
We propose algorithms for efficiently maintaining a constant-approximate minimum connected dominating set (MCDS) of a geometric graph under node insertions and deletions. Assuming...
Leonidas J. Guibas, Nikola Milosavljevic, Arik Mot...
CG
2004
Springer
13 years 9 months ago
Occlusion Culling in OpenSG PLUS
Very large polygonal models are frequently used in scientific computing, mechanical engineering, or virtual medicine. An effective technique to handle these large models is occlus...
Dirk Staneker, Dirk Bartz, Wolfgang Straßer
ICDE
2009
IEEE
139views Database» more  ICDE 2009»
14 years 10 months ago
Minimizing Communication Cost in Distributed Multi-query Processing
Increasing prevalence of large-scale distributed monitoring and computing environments such as sensor networks, scientific federations, Grids etc., has led to a renewed interest in...
Jian Li, Amol Deshpande, Samir Khuller
P2P
2009
IEEE
231views Communications» more  P2P 2009»
14 years 3 months ago
Measuring the Cost of Online Load-Balancing in Distributed Range-Queriable Systems
Distributed systems such as Peer-to-Peer overlays have been shown to efficiently support the processing of range queries over large numbers of participating hosts. In such system...
Ioannis Konstantinou, Dimitrios Tsoumakos, Nectari...