Vladimir Zadorozhny, Divyasheel Sharma · 2008
In this paper we propose a query-driven approach for tuning the time/energy trade-off in sensor networks with mobile sensors. The tuning factors include re-positioning of mobile sensors and changing their transmission ranges. We propose an algebraic query optimization framework that explores these factors while utilizing collision-free concurrent data transmissions with different degrees of data filtering and aggregation. Categories and Subject Descriptors C.2.1 [Computer – Communication Networks]: Network
Cited by 0
Vandana Jindal, Anil K. Verma, Seema Bawa · International Journal of Computer Theory and Engineering · 2011
Cited by 1
Gibbins, Nicholas · EdShare Southampton (University of Southampton)
Cited by 0
Gibbins, Nicholas · EdShare Southampton (University of Southampton)
Cited by 0
Elisa Bertino, Barbara Catania, FERRARI, ELENA · IrInSubria (University of Insubria) · 1997
Cited by 0
Angela Bonifati, George Fletcher, Hannes Voigt et al. · Synthesis lectures on data management · 2018
Cited by 0
Divyasheel Sharma · 2008
In this paper, we introduce a rotating interrogation technique for sensor networks called Whirlpool. Whirlpool provides opportunities to optimize data delivery in time-critical monitoring applications. We explore concurrency opportunities while delivering data using the whirlpool strategy and investigate several whirlpool algorithms. We also demonstrate extra benefits of using whirlpool with our algebraic optimization framework based on Data Transmission Algebra. Categories and Subject Descriptors
Cited by 0
Jens-peter Dittrich, Bernhard Seeger · 2008
Support for exploratory interaction with databases in applications such as data mining requires that the first few results of an operation be available as quickly as possible. We study the algorithmic side of what can and what cannot be achieved for processing join operations. We develop strategies that modify the strict two-phase processing of the sort-merge paradigm, intermingling join steps with selected merge phases of the sort. We propose an algorithm that produces early join results for a broad class of join problems, including many not addressed well by hash-based algorithms. Our algorithm has no significant increase in the number of I/O operations needed to complete the join compared to standard sort-merge algorithms.
Cited by 0
Gibbins, Nicholas · EdShare Southampton (University of Southampton) · 2015
Cited by 0
Shen-mou Hsu, Luiz Pessoa · 1996
Cited by 0
SpringerReference · 2011
Cited by 0
Elisa Bertino, Barbara Catania, Elena Ferrari · 1997
Cited by 1
Encyclopedia of Database Systems · 2009
Cited by 0
Stavros Papadopoulos · 2010
Authenticated query processing by Stavros Papadopoulos thesis 2010 xii, 138 p. : ill. ; 30 cm An increasing number of enterprizes outsource database functionality to third-party service providers, which answer queries received from clients. These providers may be untrustworthy and…Read more ›
Cited by 0
Kemele M. Endris, María-Esther Vidal, Damien Graux · TIB Repositorium · 2020
Cited by 1Open access
2001
Cited by 0
SpringerReference · 2011
Cited by 0
Professor Reda Alhajj, Professor Jon Rokne · 2014
Cited by 0
2020
Cited by 2
Staab, Steffen · EdShare Southampton (University of Southampton)
Cited by 0