منابع مشابه
Efficient Query Processing in Distributed RDF Databases
The Semantic Web takes the concept of data integration in a mediator architecture to a new level. Since the distribution of data is not managed centrally, query processing over a set of autonomous data stores poses new challenges for query optimization. Because URIs provide a global resource identification mechanism and RDF data stores have no schema, all data stores can potentially have inform...
متن کاملEfficient Distributed Continuous Query Processing using Peers
In this paper, we present the design and evaluation of CQ-Buddy, a peer-to-peer (p2p) continuous query (CQ) processing system that is distributed, and highly-scalable. CQ-Buddy exploits the differences in capabilities (processing and memory) of peers and load-balances the tasks across powerful and weak peers. Our main contributions are as follows: First, CQ-Buddy introduces the notion of pervas...
متن کاملEfficient Distributed Top-k Query Processing with Caching
Recently, there has been an increased interest in incorporating in database management systems rank-aware query operators, such as top-k queries, that allow users to retrieve only the most interesting data objects. In this paper, we propose a cache-based approach for efficiently supporting top-k queries in distributed database management systems. In large distributed systems, the query performa...
متن کاملEfficient OLAP Query Processing in Distributed Data Warehouses
The success of Internet applications has led to an explosive growth in the demand for bandwidth from ISPs. Managing an IP network requires collecting and analyzing network data, such as flowlevel traffic statistics. Such analyses can typically be expressed as OLAP queries, e.g., correlated aggregate queries and data cubes. Current day OLAP tools for this task assume the availability of the data...
متن کاملEfficient Top-k Query Processing Algorithms in Highly Distributed Environments
Efficient top-k query processing in highly distributed environments is a valuable but challenging research topic. This paper focuses on the problem over vertically partitioned data and aims to propose more efficient algorithms.. The effort is put on limiting the data transferred and communication round trips among nodes to reduce the communication cost of the query processing. Two novel algorit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Automation Science and Engineering
سال: 2016
ISSN: 1545-5955,1558-3783
DOI: 10.1109/tase.2016.2530941