Sciweavers

707 search results - page 90 / 142
» Processing queries on tree-structured data efficiently
Sort
View
DEBS
2007
ACM
14 years 19 days ago
Temporal order optimizations of incremental joins for composite event detection
Queries for composite events typically involve the four complementary dimensions of event data, event composition, relationships between events (esp. temporal and causal), and acc...
François Bry, Michael Eckert
WWW
2005
ACM
14 years 9 months ago
A fast XPATH evaluation technique with the facility of updates
This paper addresses the problem of fast retrieval of data from XML documents by providing a labeling schema that can easily handle simple as well as complex XPATH queries and als...
Ashish Virmani, Suchit Agarwal, Rahul Thathoo, She...
WAIM
2007
Springer
14 years 2 months ago
Distributed, Hierarchical Clustering and Summarization in Sensor Networks
We propose DHCS, a method of distributed, hierarchical clustering and summarization for online data analysis and mining in sensor networks. Different from the acquisition and aggre...
Xiuli Ma, Shuangfeng Li, Qiong Luo, Dongqing Yang,...
MOBIHOC
2009
ACM
14 years 9 months ago
Secure multidimensional range queries in sensor networks
Most future large-scale sensor networks are expected to follow a two-tier architecture which consists of resource-rich master nodes at the upper tier and resource-poor sensor node...
Rui Zhang, Jing Shi, Yanchao Zhang
DBA
2006
236views Database» more  DBA 2006»
13 years 10 months ago
Quantizing Time Series for Efficient Subsequence Matching
Indexing time series data is an interesting problem that has attracted much interest in the research community for the last decade. Traditional indexing methods organize the data ...
Inés Fernando Vega López, Bongki Moo...