Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/78299
DC FieldValue
dc.titleProcessing of multiple long-running queries in large-scale geo-data repositories
dc.contributor.authorTok, W.H.
dc.contributor.authorBressan, S.
dc.date.accessioned2014-07-04T03:14:43Z
dc.date.available2014-07-04T03:14:43Z
dc.date.issued2006
dc.identifier.citationTok, W.H.,Bressan, S. (2006). Processing of multiple long-running queries in large-scale geo-data repositories. Proceedings - International Workshop on Database and Expert Systems Applications, DEXA : 627-631. ScholarBank@NUS Repository.
dc.identifier.isbn0769526411
dc.identifier.issn15294188
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/78299
dc.description.abstractOne of the main challenges of large-scale information mediation and warehousing is the efficient and resourceeffective processing of continuous queries. Continuous queries monitor streams of incoming data and produce results on-the-fly. They are usually long-running, yet need to be removed from the system when they become obsolete. We present a framework and the corresponding algorithms and data-structures for the efficient evaluation of multiple longrunning spatial queries over unbounded streams of spatial data and the management of obsolete queries. Using both real-life and synthetic datasets and workloads, we show that our proposed approach achieves significant improvements over standard approaches. Copyright © 2006 by The Institute of Electrical and Electronics Engineers, Inc.
dc.sourceScopus
dc.typeConference Paper
dc.contributor.departmentCOMPUTER SCIENCE
dc.description.sourcetitleProceedings - International Workshop on Database and Expert Systems Applications, DEXA
dc.description.page627-631
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Page view(s)

98
checked on Jan 20, 2022

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.