Sciweavers

958 search results - page 54 / 192
» Efficient data structures for range-aggregate queries on tre...
Sort
View
INFOCOM
2010
IEEE
14 years 10 months ago
SafeQ: Secure and Efficient Query Processing in Sensor Networks
The architecture of two-tiered sensor networks, where storage nodes serve as an intermediate tier between sensors and a sink for storing data and processing queries, has been widel...
Fei Chen, Alex X. Liu
124
Voted
DMIN
2007
158views Data Mining» more  DMIN 2007»
15 years 2 months ago
Mining Frequent Itemsets Using Re-Usable Data Structure
- Several algorithms have been introduced for mining frequent itemsets. The recent datasettransformation approach suffers either from the possible increasing in the number of struc...
Mohamed Yakout, Alaaeldin M. Hafez, Hussein Aly
DEXAW
2007
IEEE
124views Database» more  DEXAW 2007»
15 years 4 months ago
XML Query Optimisation: Specify your Selectivity
The problem of efficiently evaluating XPath and XQuery queries has become increasingly significant since more and more XML data is stored in its native form. We propose a novel op...
Sven Hartmann, Sebastian Link
DATESO
2009
158views Database» more  DATESO 2009»
14 years 10 months ago
Benchmarking Coding Algorithms for the R-tree Compression
Multi-dimensional data structures have been widely applied in many data management fields. Spatial data indexing is their natural application, however there are many applications i...
Jirí Walder, Michal Krátký, R...
WWW
2008
ACM
16 years 1 months ago
Race: finding and ranking compact connected trees for keyword proximity search over xml documents
In this paper, we study the problem of keyword proximity search over XML documents and leverage the efficiency and effectiveness. We take the disjunctive semantics among input key...
Guoliang Li, Jianhua Feng, Jianyong Wang, Bei Yu, ...