A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Filters
Monitoring the Top-m Aggregation in a Sliding Window of Spatial Queries
[article]
2016
arXiv
pre-print
Preserved Fulltext
Other Versions
In this paper, we propose and study the problem of top-m rank aggregation of spatial objects in streaming queries, where, given a set of objects O, a stream of spatial queries (kNN or range), the goal ...
of objects to update in the top-m results. ...
In this paper, we presented the problem of top-m rank aggregation of spatial objects for streaming queries. ...
arXiv:1610.03579v2
fatcat:gjypdixutnek7ofxtqrrc22m5y
Continuously monitoring top-k uncertain data streams: a probabilistic threshold method
2009
Distributed and parallel databases
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
In this paper, we formulate a novel and challenging problem of continuously monitoring top-k uncertain data streams, and propose a probabilistic threshold method. ...
Although a significant amount of previous research explores various continuous queries on data streams, continuous queries on uncertain data streams have seldom been investigated. ...
Continuously monitoring probabilistic threshold top-k aggregate queries. ...
doi:10.1007/s10619-009-7043-x
fatcat:ti4uiuns7rgrjensmqgoypmvsi
Hierarchical information quadtree: efficient spatial temporal image search for multimedia stream
2018
Multimedia tools and applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2018 pre-print arXiv:1806.03483v1 fatcat:m4l2mgkbgjdbffuecr5a6shphmOther Versions
In this paper,we study the spatial temporal image query which considers three important constraints during the search including time recency, spatial proximity and visual relevance. ...
Due to their importance, a large body of work has focused on efficiently computing various spatial image queries. ...
M To process spatial temporal image queries with HI-Quadtree framework, we exploit the best-first traversal algorithm for retrieving the top-k objects. ...
doi:10.1007/s11042-018-6284-y
fatcat:amn26lahx5agfhkurpvtqfmwlq
GeoRank
2013
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems - SIGSPATIAL'13
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
In this paper, we present Geo-Rank, an efficient location-aware news feed ranking system that provides top-k new feeds based on (a) spatial proximity, (b) temporal proximity, and (c) user preferences. ...
The query processor module is triggered by the user, upon logging on to the system, to provide the top-k ranked location-based news feeds. ...
This means that if M was posted older than T time units, M will have no chance in making it to the top-k items. • Number boundary. We start by the objective of getting the top-k messages. ...
doi:10.1145/2525314.2525336
dblp:conf/gis/0003M13
fatcat:xpfglqkg3nfyvl37kgovmpfo64
Spatio-temporal top-k term search over sliding window
2018
World wide web (Bussum)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Specifically, given a query location and a set of geo-tagged messages within a sliding window, we study the problem of searching for the top-k terms by considering term frequency, spatial proximity, and ...
In part due to the proliferation of GPS-equipped mobile devices, massive volumes of geo-tagged streaming text messages are becoming available on social media. ...
It supports finding and tracking the objects, events or stories in real world, monitoring most of the hot keywords as well as the temporal/spatial bursts. ...
doi:10.1007/s11280-018-0606-x
fatcat:bqthhmo3hfaf3onnfysko2e2ja
Large-Scale Indexing, Discovery, and Ranking for the Internet of Things (IoT)
2018
ACM Computing Surveys
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The primary objective of this paper is to provide a holistic overview of the state-of-the-art on indexing, discovery and ranking of IoT data. ...
The Internet of Things (IoT) consists of the network-enabled devices and communication technologies that allow connectivity and integration of physical objects (Things) into the digital world (Internet ...
ACKNOWLEDGMENTS This work is supported by the European Commission's Seventh Framework Programme (EU FP7) for the CityPulse projectnder Grant No.: 609035 (http://www.ict-citypulse.eu/) and the EU Horizon ...
doi:10.1145/3154525
fatcat:g6h4h6ezorhkda6qmgibgn4dtm
Cluster By
2007
Proceedings of the 15th annual ACM international symposium on Advances in geographic information systems - GIS '07
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Queries on these geo-referenced data often require the aggregation of isolated data points to form spatial clusters and obtain properties of the clusters. ...
In this paper, we aim at introducing Cluster By into spatial databases to allow a broad range of interesting queries to be posted on spatial clusters. ...
[7] on generalizing Order By and Group By to support fuzzy grouping and top-k ranking. ...
doi:10.1145/1341012.1341077
dblp:conf/gis/ZhangH07
fatcat:ewcwixbwpveuhcy7y7qf7jqpby
Design an Efficient Top-K Query Retrieval Technique for GIQ problems
2015
Journal of advance research in computer science & enigneering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
In a given geometric objects, set of objects are retrieved as results for the given query. The problem is defined as geometric query intersection problem. ...
In our proposed system we are going to perform multiple query processing. Because in the existing approach it can able to process only one query at the time. ...
A simple, yet effective, aggregation function is the so-called top-k function which returns a set of k objects that best satisfy a query, where the notion of "best" is based on a real-valued weight assigned ...
doi:10.53555/nncse.v2i5.446
fatcat:5jyngfxy4zaj7atx2zyst4wxqm
Ranking queries on uncertain data
2010
The VLDB journal
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Continuously monitoring probabilistic threshold top-k aggregate queries. ...
and ranking the aggregates of a set of uncertain objects. ...
doi:10.1007/s00778-010-0196-4
fatcat:xogk2bxoyfbapdjvjdmrfdseua
Location-Based Top-k Term Querying over Sliding Window
[chapter]
2017
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In part due to the proliferation of GPS-equipped mobile devices, massive volumes of geo-tagged streaming text messages are becoming available on social media. ...
In this paper, we present novel indexing, updating, and query processing techniques that are capable of discovering top-k locally popular nearby terms over a sliding window. ...
It supports finding and tracking the objects, events or stories in real world, monitoring most of the hot keywords as well as the temporal/spatial bursts. ...
doi:10.1007/978-3-319-68783-4_21
fatcat:yqjiux3uevclbex7wkpgebwg2m
VDBMS: A testbed facility for research in video database benchmarking
2004
Multimedia Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
VDBMS research 1 is motivated by the requirements of video-based applications to search by content, and by the need for testbed facilities for research in video database management. ...
The research issues addressed include: MPEG7 for multimedia content representation, techniques for image processing, high-dimensional indexing, multimedia query processing and optimization, new query operators ...
The number of features m in our study varies from 2 to 6, and the number of top-ranked results k varies from 5 to 100. ...
doi:10.1007/s00530-003-0129-9
fatcat:lbkayo4w6fdtdoj7nyitf3jn74
Search Techniques for the Web of Things: A Taxonomy and Survey
2016
Sensors
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Search is fundamental to the Web of Things while challenging by nature in this context, e.g., mobility of the objects, opportunistic presence and sensing, continuous data streams with changing spatial ...
Since sensor networks have been increasingly deployed to monitor environments all around the world, sensors and their O&M data are becoming more and more important in the Web of Things. ...
For this study, we adopt the WoT system model proposed in [16] (shown in Figure 2 ). ...
doi:10.3390/s16050600
pmid:27128918
pmcid:PMC4883291
fatcat:z3bigpprj5ho3jespbwib6fjju
Time- and Space-Efficient Sliding Window Top-k Query Processing
2015
ACM Transactions on Database Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
A sliding window top-k (top-k/w) query monitors incoming data stream objects within a sliding window of size w to identify the k highest-ranked objects with respect to a given scoring function over time ...
Processing of such queries is challenging because, even when an object is not a top-k/w object at the time when it enters the processing system, it might become one in the future. ...
We study a particular type of continuous queries which monitor top-k data objects over sliding windows (top-k/w queries). ...
doi:10.1145/2736701
fatcat:4milbhuk4rhkde4dub5ek2yrdq
Comparative Analysis on Mobility Aware and Stateless Multicast Routing Protocols in Mobile Ad-Hoc Networks
2012
IOSR Journal of Computer Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
In this paper, the author has studied the performance of multicast routing protocols in wireless mobile ad-hoc networks. ...
Several virtual architectures are used in the protocol without need of maintaining state information for more robust and scalable membership management and packet forwarding in the presence of high network ...
Acknowledgement The author would like to thank the anonymous reviewers for their many valuable comments and suggestions that helped to improve both the technical content and the presentation quality of ...
doi:10.9790/0661-0650107
fatcat:cil6cynn2ffcje37bw2x25bcli
Monitoring reverse top-k queries over mobile devices
2011
Proceedings of the 10th ACM International Workshop on Data Engineering for Wireless and Mobile Access - MobiDE '11
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we define the distance-based reverse top-k query suitable for mobile environments. ...
The problem we target is given a query point q, how to efficiently monitor q's distance-based reverse top-k result set. ...
ranked than p in m's distance-based top-k query. ...
doi:10.1145/1999309.1999313
dblp:conf/mobide/VlachouDN11
fatcat:66zsluvyefdizfxocopxdzw52q
« Previous
Showing results 1 — 15 out of 3,872 results