Sciweavers

2724 search results - page 393 / 545
» Optimizing Queries on Files
Sort
View
121
Voted
JGTOOLS
2008
100views more  JGTOOLS 2008»
15 years 3 months ago
Proximity Cluster Trees
Hierarchical spatial data structures provide a means for organizing data for efficient processing. Most spatial data structures are optimized for performing queries, such as inters...
Elena Jakubiak Hutchinson, Sarah F. Frisken, Ronal...
DKE
2007
119views more  DKE 2007»
15 years 3 months ago
Error minimization in approximate range aggregates
Histogram techniques have been used in many commercial database management systems to estimate a query result size. Recently, it has been shown that they are very effective to su...
Xuemin Lin, Qing Zhang, Yidong Yuan, Qing Liu
146
Voted
JIIS
2006
76views more  JIIS 2006»
15 years 3 months ago
Holes in joins
A join of two relations in real databases is usually much smaller than their cartesian product. This means that most of the combinations of tuples in the crossproduct of the respe...
Jarek Gryz, Dongming Liang
104
Voted
IJWIN
2007
68views more  IJWIN 2007»
15 years 3 months ago
Density-Independent, Scalable Search in Ad Hoc Networks
— We analyze the asymptotic cost of discovering a route within a flat ad hoc network and we show that one can discover a route with cost that is proportional only to the area of...
Zygmunt J. Haas, Rimon Barr
126
Voted
CG
2004
Springer
15 years 3 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