Sciweavers

1007 search results - page 46 / 202
» Worst-Case Optimal Algorithms for Parallel Query Processing
Sort
View
IDEAS
2008
IEEE
153views Database» more  IDEAS 2008»
15 years 8 months ago
Pattern based processing of XPath queries
As the popularity of areas including document storage and distributed systems continues to grow, the demand for high performance XML databases is increasingly evident. This has le...
Gerard Marks, Mark Roantree
ICDCN
2009
Springer
15 years 7 months ago
Optimizing Multi-hop Queries in ZigBee Based Multi-sink Sensor Networks
Wireless sensor networks with multiple users collecting data directly from the sensors have many potential applications. An important problem is to allocate for each user a query r...
Bing Han, Gwendal Simon
DBISP2P
2005
Springer
82views Database» more  DBISP2P 2005»
15 years 8 months ago
Range Query Optimization Leveraging Peer Heterogeneity in DHT Data Networks
In this work we address the issue of efficient processing of range queries in DHT-based P2P data networks. The novelty of the proposed approach lies on architectures, algorithms, ...
Nikos Ntarmos, Theoni Pitoura, Peter Triantafillou
SIGMOD
2008
ACM
182views Database» more  SIGMOD 2008»
16 years 2 months ago
Angle-based space partitioning for efficient parallel skyline computation
Recently, skyline queries have attracted much attention in the database research community. Space partitioning techniques, such as recursive division of the data space, have been ...
Akrivi Vlachou, Christos Doulkeridis, Yannis Kotid...
WWW
2010
ACM
15 years 9 months ago
Optimal rare query suggestion with implicit user feedback
Query suggestion has been an effective approach to help users narrow down to the information they need. However, most of existing studies focused on only popular/head queries. Si...
Yang Song, Li-wei He