Sciweavers

1168 search results - page 69 / 234
» Optimization strategies for complex queries
Sort
View
SIGMOD
2010
ACM
308views Database» more  SIGMOD 2010»
14 years 8 months ago
GBLENDER: towards blending visual query formulation and query processing in graph databases
Given a graph database D and a query graph g, an exact subgraph matching query asks for the set S of graphs in D that contain g as a subgraph. This type of queries find important...
Changjiu Jin, Sourav S. Bhowmick, Xiaokui Xiao, Ja...
TC
2011
14 years 4 months ago
Complexity of Data Collection, Aggregation, and Selection for Wireless Sensor Networks
— Processing the gathered information efficiently is a key functionality for wireless sensor networks. In this article, we study the time complexity, message complexity (number ...
Xiang-Yang Li, Yajun Wang, Yu Wang
WWW
2008
ACM
14 years 9 months ago
Divide, Compress and Conquer: Querying XML via Partitioned Path-Based Compressed Data Blocks
We propose a novel Partition Path-Based (PPB) grouping strategy to store compressed XML data in a stream of blocks. In addition, we employ a minimal indexing scheme called Block S...
Wilfred Ng, Ho Lam Lau, Aoying Zhou
PVLDB
2010
133views more  PVLDB 2010»
14 years 8 months ago
RoadTrack: Scaling Location Updates for Mobile Clients on Road Networks with Query Awareness
Mobile commerce and location based services (LBS) are some of the fastest growing IT industries in the last five years. Location update of mobile clients is a fundamental capabil...
Péter Pesti, Ling Liu, Bhuvan Bamba, Arun I...
GECCO
2007
Springer
138views Optimization» more  GECCO 2007»
15 years 4 months ago
Reducing the space-time complexity of the CMA-ES
A limited memory version of the covariance matrix adaptation evolution strategy (CMA-ES) is presented. This algorithm, L-CMA-ES, improves the space and time complexity of the CMA-...
James N. Knight, Monte Lunacek