Zobrazeno 1 - 10
of 167
pro vyhledávání: '"Vassilis J. Tsotras"'
Publikováno v:
ACM Transactions on Spatial Algorithms and Systems. 9:1-35
A region ℛ is a dwell region for a moving object O if, given a threshold distance r q and duration τ q , every point of ℛ remains within distance r q from O for at least time τ q . Points within ℛ are likely to be of interest to O , so identi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::91c881dc025ea91ccc7071c7160ccf3b
https://doi.org/10.1145/3543850
https://doi.org/10.1145/3543850
Publikováno v:
The VLDB Journal. 32:501-524
We introduce the ReverseSpatial Top-kKeyword (RSK) query, which is defined as: given a query term q, an integer k and a neighborhood size find all the neighborhoods of that size where q is in the top-k most frequent terms among the social posts in th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::55676ffa2132ea3bceef359a72adeb62
https://doi.org/10.1007/s00778-022-00759-9
https://doi.org/10.1007/s00778-022-00759-9
Publikováno v:
GeoInformatica.
This paper studies the spatial group-by query over complex polygons. Given a set of spatial points and a set of polygons, the spatial group-by query returns the number of points that lie within the boundaries of each polygon. Groups are selected from
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::903194d36f644cdcd0bd61e6eb865a49
https://doi.org/10.1007/s10707-023-00491-8
https://doi.org/10.1007/s10707-023-00491-8
Publikováno v:
Distributed and parallel databases. 40(2-3)
Today, data is being actively generated by a variety of devices, services, and applications. Such data is important not only for the information that it contains, but also for its relationships to other data and to interested users. Most existing Big
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7eecfc9abda16ebeee9fc35ba3234554
https://pubmed.ncbi.nlm.nih.gov/35411128
https://pubmed.ncbi.nlm.nih.gov/35411128
Publikováno v:
The VLDB Journal. 29:1337-1364
Virtually all of today's Big Data systems are passive in nature, responding to queries posted by their users. Instead, we are working to shift Big Data platforms from passive to active. In our view, a Big Active Data (BAD) system should continuously
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1de42ff1bf656f8659639da1d9e5f155
https://doi.org/10.1007/s00778-020-00616-7
https://doi.org/10.1007/s00778-020-00616-7
Autor:
Akil Sevim, Ahmed Eldawy, Michael J. Carey, Tin Vu, Vassilis J. Tsotras, Mehnaz Tabassum Mahin, Ian Maxon
Publikováno v:
SpatialAPI@SIGSPATIAL
There is immense potential with spatial data, which is even more significant when combined with temporal or textual features, or both. However, it is expensive to store and analyze spatial data, and it is even more challenging with the combined featu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5a48eb0d1a80bd183d1dfd1162a926fa
https://doi.org/10.1145/3486189.3490018
https://doi.org/10.1145/3486189.3490018
Publikováno v:
DEBS
Traditional big data infrastructures are passive in nature, passively answering user requests to process and return data. In many applications however, users not only need to analyze data, but also to subscribe to and actively receive data of interes
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2b799d787b17ad6d10a7a19f74dd1627
https://doi.org/10.1145/3465480.3467840
https://doi.org/10.1145/3465480.3467840
Publikováno v:
MDM
A spatiotemporal reachability query identifies whether a physical item (or information, virus etc.) could have been transferred from the source moving object O S to the target moving object O T during a time interval I (either directly, or through a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9f02554803ca4e6217e0cfb491ce7d28
https://doi.org/10.1109/mdm52706.2021.00036
https://doi.org/10.1109/mdm52706.2021.00036
Publikováno v:
Proceedings of the VLDB Endowment. 13:114-127
Efficient Top- k query evaluation relies on practices that utilize auxiliary data structures to enable early termination. Such techniques were designed to trade-off complex work in the buffer pool against costly access to disk-resident data. Parallel
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5b0abab3c1ca6aa2bc86180c83aec223
https://doi.org/10.14778/3364324.3364327
https://doi.org/10.14778/3364324.3364327
Autor:
Qizhong Mao, Steven Jacobs, Neal E. Young, Vagelis Hristidis, Vassilis J. Tsotras, Waleed Amjad
Publikováno v:
VLDB Journal, vol 30, iss 3
The VLDB Journal, vol 30, iss 3
The VLDB Journal, vol 30, iss 3
Modern NoSQL database systems use log-structured merge (LSM) storage architectures to support high write throughput. LSM architectures aggregate writes in a mutable MemTable (stored in memory), which is regularly flushed to disk, creating a new immut
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4a244314fe0edd803e7a4ecfa8b5959e
https://escholarship.org/uc/item/2pw0r9m2
https://escholarship.org/uc/item/2pw0r9m2
