Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleJune 2022
HYPERSONIC: A Hybrid Parallelization Approach for Scalable Complex Event Processing
SIGMOD '22: Proceedings of the 2022 International Conference on Management of DataJune 2022, Pages 1093–1107https://doi.org/10.1145/3514221.3517829The ability to promptly and efficiently detect arbitrarily complex patterns in massive real-time data streams is a crucial requirement in many modern applications. The ever-growing scale of these applications and the sophistication of the patterns ...
- research-articleNovember 2020
Distributed Spatiotemporal Trajectory Query Processing in SQL
SIGSPATIAL '20: Proceedings of the 28th International Conference on Advances in Geographic Information SystemsNovember 2020, Pages 87–98https://doi.org/10.1145/3397536.3422262Nowadays, the collection of moving object data is significantly increasing due to the ubiquity of GPS-enabled devices. Managing and analyzing this kind of data is crucial in many application domains, including social mobility, pandemics, and ...
- research-articleJanuary 2019
Distributed continuous KNN query over moving objects
International Journal of High Performance Computing and Networking (IJHPCN), Volume 14, Issue 22019, Pages 130–138https://doi.org/10.1504/ijhpcn.2019.101250The Continuous K-Nearest Neighbour (CKNN) queries over moving objects have been widely researched in many fields. However, existing centralised works cannot work anymore and distributed solutions suffer the problem of index maintaining, high communication ...
- research-articleJanuary 2017
Distributed query processing in the presence of blank nodes
This paper demonstrates that the presence of blank nodes in RDF data represents a problem for distributed processing of SPARQL queries. It is shown that the usual decomposition strategies from the literature will leak information – even when information ...
- demonstrationJuly 2016
Array Database Scalability: Intercontinental Queries on Petabyte Datasets
SSDBM '16: Proceedings of the 28th International Conference on Scientific and Statistical Database ManagementJuly 2016, Article No.: 25, Pages 1–5https://doi.org/10.1145/2949689.2949717With the deluge of scientific big data affecting a large variety of research institutions, support for large multidimensional arrays has gained traction in the database community in the past decade. Array databases aim to cover the gap left by ...
-
- research-articleJune 2016
How to Win a Hot Dog Eating Contest: Distributed Incremental View Maintenance with Batch Updates
SIGMOD '16: Proceedings of the 2016 International Conference on Management of DataJune 2016, Pages 511–526https://doi.org/10.1145/2882903.2915246In the quest for valuable information, modern big data applications continuously monitor streams of data. These applications demand low latency stream processing even when faced with high volume and velocity of incoming changes and the user's desire to ...
- research-articleJune 2016
Elastic Pipelining in an In-Memory Database Cluster
SIGMOD '16: Proceedings of the 2016 International Conference on Management of DataJune 2016, Pages 1279–1294https://doi.org/10.1145/2882903.2882904An in-memory database cluster consists of multiple interconnected nodes with a large capacity of RAM and modern multi-core CPUs. As a conventional query processing strategy, pipelining remains a promising solution for in-memory parallel database systems,...
- ArticleSeptember 2015
HRDBMS: A NewSQL Database for Analytics
CLUSTER '15: Proceedings of the 2015 IEEE International Conference on Cluster ComputingSeptember 2015, Pages 519–520https://doi.org/10.1109/CLUSTER.2015.92HRDBMS is a novel distributed relational database that uses a hybrid model combining the best of traditional distributed relational databases and Big Data analytics platforms such as Hive. This allows HRDBMS to leverage years worth of research regarding ...
- research-articleMay 2015
Rack-Scale In-Memory Join Processing using RDMA
SIGMOD '15: Proceedings of the 2015 ACM SIGMOD International Conference on Management of DataMay 2015, Pages 1463–1475https://doi.org/10.1145/2723372.2750547Database systems running on a cluster of machines, i.e. rack-scale databases, are a common architecture for many large databases and data appliances. As the data movement across machines is often a significant bottleneck, these systems typically use a ...
- research-articleMay 2015
Scalable Distributed Processing of K Nearest Neighbor Queries over Moving Objects
IEEE Transactions on Knowledge and Data Engineering (IEEECS_TKDE), Volume 27, Issue 5May 2015, Pages 1383–1396https://doi.org/10.1109/TKDE.2014.2364046Central to many applications involving moving objects is the task of processing k-nearest neighbor (k-NN) queries. Most of the existing approaches to this problem are designed for the centralized setting where query processing takes place on a single ...
- posterApril 2014
Partout: a distributed engine for efficient RDF processing
WWW '14 Companion: Proceedings of the 23rd International Conference on World Wide WebApril 2014, Pages 267–268https://doi.org/10.1145/2567948.2577302The increasing interest in Semantic Web technologies has led not only to a rapid growth of semantic data on the Web but also to an increasing number of backend applications relying on efficient query processing. Confronted with such a trend, existing ...
- research-articleSeptember 2013
A term-based inverted index partitioning model for efficient distributed query processing
ACM Transactions on the Web (TWEB), Volume 7, Issue 3Article No.: 15, Pages 1–23https://doi.org/10.1145/2516633.2516637In a shared-nothing, distributed text retrieval system, queries are processed over an inverted index that is partitioned among a number of index servers. In practice, the index is either document-based or term-based partitioned. This choice is made ...
- ArticleMay 2013
Distributed Query Processing in an Ad-hoc Semantic Web Data Sharing System
IPDPSW '13: Proceedings of the 2013 IEEE 27th International Symposium on Parallel and Distributed Processing Workshops and PhD ForumMay 2013, Pages 687–695https://doi.org/10.1109/IPDPSW.2013.53Sharing the Semantic Web data in proprietary datasets in which data is encoded in RDF triples in a decentralized environment calls for efficient support from distributed computing technologies. The highly dynamic ad-hoc settings that would be pervasive ...
- research-articleMay 2013
Estimating communication costs for distributed XML query processing
In distributed query processing, good estimation algorithms of communication costs are critical for query processing, including distributed XML queries. There are techniques that estimate a communication cost for distributed SQL query processing, and ...
- ArticleApril 2013
A strategy for optimizing a multi-site query in a distributed spatial database
W2GIS'13: Proceedings of the 12th international conference on Web and Wireless Geographical Information SystemsApril 2013, Pages 16–24https://doi.org/10.1007/978-3-642-37087-8_2In this paper, we present a novel strategy for distributed spatial query optimization that involves multiple sites. Most previous work in the area of distributed spatial query processing and optimization focuses only on strategies for performing spatial ...
- research-articleNovember 2012
Approximate hybrid query processing in wireless sensor networks
SIGSPATIAL '12: Proceedings of the 20th International Conference on Advances in Geographic Information SystemsNovember 2012, Pages 542–545https://doi.org/10.1145/2424321.2424410We address the problem of efficient in-network processing of hybrid spatial queries in Wireless Sensor Networks (WSN), where the data may correspond to different physical phenomena in different regions. We propose space and communication efficient ...
- research-articleJune 2012
Query Planning for Continuous Aggregation Queries over a Network of Data Aggregators
IEEE Transactions on Knowledge and Data Engineering (IEEECS_TKDE), Volume 24, Issue 6June 2012, Pages 1065–1079https://doi.org/10.1109/TKDE.2011.12Continuous queries are used to monitor changes to time varying data and to provide results useful for online decision making. Typically a user desires to obtain the value of some aggregation function over distributed data items, for example, to know ...
- research-articleMay 2012
Towards benefit-based RDF source selection for SPARQL queries
SWIM '12: Proceedings of the 4th International Workshop on Semantic Web Information ManagementMay 2012, Article No.: 2, Pages 1–8https://doi.org/10.1145/2237867.2237869The Linked Data cloud consists of a great variety of data provided by an increasing number of sources. Selecting relevant sources is therefore a core ingredient of efficient query processing. So far, this is either done with additional indexes or by ...
- research-articleApril 2012
Scalable search platform: improving pipelined query processing for distributed full-text retrieval
WWW '12 Companion: Proceedings of the 21st International Conference on World Wide WebApril 2012, Pages 145–150https://doi.org/10.1145/2187980.2187999In theory, term-wise partitioned indexes may provide higher throughput than document-wise partitioned. In practice, term-wise partitioning shows lacking scalability with increasing collection size and intra-query parallelism, which leads to long query ...
- research-articleMarch 2012
Efficient distributed query processing for autonomous RDF databases
EDBT '12: Proceedings of the 15th International Conference on Extending Database TechnologyMarch 2012, Pages 372–383https://doi.org/10.1145/2247596.2247640The inherent flexibility of the RDF data model has led to its notable adoption in many domains, especially in the area of life-sciences. Some of these domains have an emerging need to access data integrated from various distributed sources of ...