Sciweavers

806 search results - page 48 / 162
» An Optimal Dynamic Data Structure for Stabbing-Semigroup Que...
Sort
View
ADC
2008
Springer
114views Database» more  ADC 2008»
13 years 11 months ago
An Integrated Access Control for Securely Querying and Updating XML Data
Many existing access controls use node filtering or querying rewriting techniques. These techniques require rather time-consuming processes such as parsing, labeling, pruning and/...
Maggie Duong, Yanchun Zhang
GIS
1999
ACM
14 years 1 months ago
A Provably Efficient Computational Model for Approximate Spatiotemporal Retrieval
: The paper is concerned with the effective and efficient processing of spatiotemporal selection queries under varying degrees of approximation. Such queries may employ operators l...
Vasilis Delis, Christos Makris, Spyros Sioutas
ICDE
2011
IEEE
238views Database» more  ICDE 2011»
13 years 19 days ago
Join queries on uncertain data: Semantics and efficient processing
— Uncertain data is quite common nowadays in a variety of modern database applications. At the same time, the join operation is one of the most important but expensive operations...
Tingjian Ge
ICDE
2009
IEEE
179views Database» more  ICDE 2009»
14 years 3 months ago
Self-Tuning, Bandwidth-Aware Monitoring for Dynamic Data Streams
— We present SMART, a self-tuning, bandwidth-aware monitoring system that maximizes result precision of continuous aggregate queries over dynamic data streams. While prior approa...
Navendu Jain, Praveen Yalagandula, Michael Dahlin,...
ICCS
2007
Springer
14 years 24 days ago
A Comparison of Different Conceptual Structures Projection Algorithms
Knowledge representation (KR) is used to store and retrieve meaningful data. This data is saved using dynamic data structures that are suitable for the style of KR being implemente...
Heather D. Pfeiffer, Roger T. Hartley