Sciweavers

958 search results - page 108 / 192
» Efficient data structures for range-aggregate queries on tre...
Sort
View
MMDB
2004
ACM
151views Multimedia» more  MMDB 2004»
15 years 3 months ago
Indexing of variable length multi-attribute motion data
Haptic data such as 3D motion capture data and sign language animation data are new forms of multimedia data. The motion data is multi-attribute, and indexing of multiattribute da...
Chuanjun Li, Gaurav N. Pradhan, Si-Qing Zheng, B. ...
ESA
2010
Springer
183views Algorithms» more  ESA 2010»
14 years 11 months ago
Spatio-temporal Range Searching over Compressed Kinetic Sensor Data
As sensor networks increase in size and number, efficient techniques are required to process the very large data sets that they generate. Frequently, sensor networks monitor object...
Sorelle A. Friedler, David M. Mount
ICDE
2012
IEEE
202views Database» more  ICDE 2012»
13 years 14 days ago
Differentially Private Spatial Decompositions
— Differential privacy has recently emerged as the de facto standard for private data release. This makes it possible to provide strong theoretical guarantees on the privacy and ...
Graham Cormode, Cecilia M. Procopiuc, Divesh Sriva...
SIGMOD
2008
ACM
193views Database» more  SIGMOD 2008»
15 years 10 months ago
ARCube: supporting ranking aggregate queries in partially materialized data cubes
Supporting ranking queries in database systems has been a popular research topic recently. However, there is a lack of study on supporting ranking queries in data warehouses where...
Tianyi Wu, Dong Xin, Jiawei Han
ICDE
2010
IEEE
371views Database» more  ICDE 2010»
15 years 9 months ago
TASM: Top-k Approximate Subtree Matching
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
Nikolaus Augsten, Denilson Barbosa, Michael H. B&o...