Sciweavers

182 search results - page 27 / 37
» Approximate Colored Range Queries
Sort
View
VLDB
2012
ACM
360views Database» more  VLDB 2012»
12 years 4 months ago
An adaptive updating protocol for reducing moving object database workload
In the last decade, spatio-temporal database research focuses on the design of effective and efficient indexing structures in support of location-based queries such as predictive...
Su Chen, Beng Chin Ooi, Zhenjie Zhang
VLDB
2008
ACM
110views Database» more  VLDB 2008»
14 years 8 months ago
Enhancing histograms by tree-like bucket indices
Histograms are used to summarize the contents of relations into a number of buckets for the estimation of query result sizes. Several techniques (e.g., MaxDiff and V-Optimal) have ...
Francesco Buccafurri, Gianluca Lax, Domenico Sacc...
CE
2008
95views more  CE 2008»
13 years 8 months ago
Enabling teachers to explore grade patterns to identify individual needs and promote fairer student assessment
Exploring student test, homework, and other assessment scores is a challenge for most teachers, especially when attempting to identify cross-assessment weaknesses and produce fina...
Sorelle A. Friedler, Yee Lin Tan, Nir J. Peer, Ben...
WADS
2005
Springer
149views Algorithms» more  WADS 2005»
14 years 1 months ago
Balanced Aspect Ratio Trees Revisited
Spatial databases support a variety of geometric queries on point data such as range searches, nearest neighbor searches, etc. Balanced Aspect Ratio (BAR) trees are hierarchical sp...
Amitabh Chaudhary, Michael T. Goodrich
TKDE
2008
162views more  TKDE 2008»
13 years 8 months ago
Continuous k-Means Monitoring over Moving Objects
Given a dataset P, a k-means query returns k points in space (called centers), such that the average squared distance between each point in P and its nearest center is minimized. S...
Zhenjie Zhang, Yin Yang, Anthony K. H. Tung, Dimit...