Prioritized evaluation of continuous moving queries over streaming locations

Patroumpas, K; Sellis, T

dc.contributor.author	Patroumpas, K	en
dc.contributor.author	Sellis, T	en
dc.date.accessioned	2014-03-01T02:45:45Z
dc.date.available	2014-03-01T02:45:45Z
dc.date.issued	2008	en
dc.identifier.issn	03029743	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/32363
dc.subject	Current Distribution	en
dc.subject	Mobile Application	en
dc.subject	Moving Object	en
dc.subject	Process Engineering	en
dc.subject	Range Query	en
dc.subject.other	Administrative data processing	en
dc.subject.other	Database systems	en
dc.subject.other	Ketones	en
dc.subject.other	Management information systems	en
dc.subject.other	Statistical methods	en
dc.subject.other	Central processors	en
dc.subject.other	Current distributions	en
dc.subject.other	Database management	en
dc.subject.other	Evaluation strategies	en
dc.subject.other	Experimental studies	en
dc.subject.other	International conferences	en
dc.subject.other	Mobile applications	en
dc.subject.other	Moving objects	en
dc.subject.other	Performance results	en
dc.subject.other	Prioritization	en
dc.subject.other	Processing engine	en
dc.subject.other	Range queries	en
dc.subject.other	Relative importance	en
dc.subject.other	Scoring functions	en
dc.subject.other	Shared computation	en
dc.subject.other	System loads	en
dc.subject.other	Users' preferences	en
dc.subject.other	Distribution functions	en
dc.title	Prioritized evaluation of continuous moving queries over streaming locations	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1007/978-3-540-69497-7_17	en
heal.identifier.secondary	http://dx.doi.org/10.1007/978-3-540-69497-7_17	en
heal.publicationDate	2008	en
heal.abstract	Existing approaches to the management of streaming positional updates generally assume that all active user requests have equal importance, ignoring the possibility of any priorities concerning delivery of results in mission-critical mobile applications. Query prioritization could be assigned either explicitly after users' preferences or implicitly by the processing engine itself to better regulate system load. In this work, we specifically examine priority-based evaluation of ranked continuous range queries against locations of moving objects streaming into a central processor. We define a versatile model with alternative scoring functions for deciding evaluation strategies adaptable to the relative importance of queries and the current distribution of objects. We also propose a processing mechanism enhanced with ranked priorities, which exploits shared computation and enables critical requests to receive response more frequently than less demanding ones. A comprehensive experimental study with performance results offers concrete evidence that such a scheme is capable of efficiently handling numerous moving queries of varying priorities and spatial extents with minimal system overhead. © 2008 Springer-Verlag.	en
heal.journalName	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)	en
dc.identifier.doi	10.1007/978-3-540-69497-7_17	en
dc.identifier.volume	5069 LNCS	en
dc.identifier.spage	240	en
dc.identifier.epage	257	en