Institutional Login
Welcome!
To use the personalized features of this site, please
log in
or
register
.
If you have forgotten your username or password, we can
help
.
My Menu
Marked Items
Alerts
Order History
Saved Items
All
Favorites
Content Types
All
Publications
Journals
Book Series
Books
Reference Works
Protocols
Subject Collections
Architecture and Design
Behavioral Science
Biomedical and Life Sciences
Business and Economics
Chemistry and Materials Science
Computer Science
Earth and Environmental Science
Engineering
Humanities, Social Sciences and Law
Mathematics and Statistics
Medicine
Physics and Astronomy
Professional and Applied Computing
中文(简体)
中文(繁體)
English
Deutsch
한국어
日本語
Français
Español
العربية
Русский
Book Chapter
Prioritized Evaluation of Continuous Moving Queries over Streaming Locations
Book Series
Lecture Notes in Computer Science
Publisher
Springer Berlin / Heidelberg
ISSN
0302-9743 (Print) 1611-3349 (Online)
Volume
Volume 5069/2008
Book
Scientific and Statistical Database Management
DOI
10.1007/978-3-540-69497-7
Copyright
2008
ISBN
978-3-540-69476-2
DOI
10.1007/978-3-540-69497-7_17
Pages
240-257
Subject Collection
Computer Science
SpringerLink Date
Friday, July 11, 2008
Add to marked items
Add to shopping cart
Add to saved items
Permissions & Reprints
Recommend this chapter
PDF (381.4 KB)
Free Preview
Prioritized Evaluation of Continuous Moving Queries over Streaming Locations
Kostas Patroumpas
1
and Timos Sellis
1
(1)
School of Electrical and Computer Engineering, National Technical University of Athens, Hellas,
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.
Kostas
Patroumpas
Email:
kpatro@dbnet.ece.ntua.gr
Timos
Sellis
Email:
timos@dbnet.ece.ntua.gr
Fulltext Preview (Small,
Large
)
References secured to subscribers.
more options
Find
Query Builder
Close
|
Clear
Title (ti)
Summary (su)
Author (au)
ISSN (issn)
ISBN (isbn)
DOI (doi)
And
Or
Not
(
)
* (wildcard)
"" (exact)
Within all content
Within this book series
Within this book
Export this chapter
Export this chapter as
RIS
|
Text
Frequently asked questions
|
General information on journals and books
|
Send us your feedback
|
Impressum
|
Contact
© Springer.
Part of Springer Science+Business Media
Privacy, Disclaimer, Terms and Conditions, © Copyright Information
MetaPress Privacy Policy
Remote Address: 38.107.191.114 • Server: mpweb03
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)