Sciweavers

565 search results - page 24 / 113
» Multiple Range Query Optimization in Spatial Databases
Sort
View
SIGMOD
2009
ACM
291views Database» more  SIGMOD 2009»
15 years 9 months ago
Partial join order optimization in the paraccel analytic database
The ParAccel Analytic DatabaseTM is a fast shared-nothing parallel relational database system with a columnar orientation, adaptive compression, memory-centric design, and an enha...
Yijou Chen, Richard L. Cole, William J. McKenna, S...
76
Voted
PVLDB
2008
81views more  PVLDB 2008»
14 years 9 months ago
Optimization of multi-domain queries on the web
Where can I attend an interesting database workshop close to a sunny beach? Who are the strongest experts on service computing based upon their recent publication record and accep...
Daniele Braga, Stefano Ceri, Florian Daniel, David...
VLDB
1998
ACM
108views Database» more  VLDB 1998»
15 years 1 months ago
MindReader: Querying Databases Through Multiple Examples
Users often can not easily express their queries. For example, in a multimedia image by content setting, the user might want photographs with sunsets; in current systems, like QBI...
Yoshiharu Ishikawa, Ravishankar Subramanya, Christ...
DEXA
2007
Springer
107views Database» more  DEXA 2007»
15 years 1 months ago
When Mobile Objects' Energy Is Not So Tight: A New Perspective on Scalability Issues of Continuous Spatial Query Systems
The two dominant costs in continuous spatial query systems are the wireless communication cost for location update, and the evaluation cost for query processing. Existing works add...
Tai T. Do, Fuyu Liu, Kien A. Hua
156
Voted
PODS
2009
ACM
119views Database» more  PODS 2009»
15 years 10 months ago
Dynamic indexability and lower bounds for dynamic one-dimensional range query indexes
The B-tree is a fundamental external index structure that is widely used for answering one-dimensional range reporting queries. Given a set of N keys, a range query can be answere...
Ke Yi