Optimizing adaptive multi-route query processing via time-partitioned indices

نویسندگان

  • Karen Works
  • Elke A. Rundensteiner
  • Emmanuel Agu
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Time-partitioned Index Design for Adaptive Multi-Route Data Stream Systems utilizing Heavy Hitter Algorithms

Adaptive multi-route query processing (AMR) is a recently emerging paradigm for processing stream queries in highly fluctuating environments. AMR dynamically routes batches of tuples to operators in the query network based on routing criteria and up-to-date system statistics. In the context of AMR systems, indexing, a core technology for efficient stream processing, has received little attentio...

متن کامل

Optimizing I/O Costs of Multi-dimensional Queries Using Bitmap Indices

Bitmap indices are efficient data structures for processing complex, multi-dimensional queries in data warehouse applications and scientific data analysis. For high-cardinality attributes, a common approach is to build bitmap indices with binning. This technique partitions the attribute values into a number of ranges, called bins, and uses bitmap vectors to represent bins (attribute ranges) rat...

متن کامل

Improving Query Throughput and Response Time for Dense Retrieval Models using Parallel Processing

Information retrieval systems have stringent operational requirements, which are met using distributed replication and partitioning. In addition, we can use dimensionality reduction to create indices in dense matrix format which can be processed more effectively on multiscalar processors and alleviate synonymy and polysemy. In another development, much of todays server hardware is equipped with...

متن کامل

A Hash Partition Strategy for Distributed Query Processing

This paper describes a hash partitioning strategy for distributed query processing in a multi-database environment in which relations are unfragmented and replicated. Methods and eecient algorithms are provided to determine the sets of relations that can be hash partitioned , the copies of the relations to be partitioned and the partition sites, how the relations are to be partitioned and where...

متن کامل

Adaptive Stream Processing

DEFINITION When querying long-lived data streams, the characteristics of the data may change over time or data may arrive in bursts — hence, the traditional model of optimizing a query prior to executing it is insufficient. As a result, most data stream management systems employ feedback-driven adaptive stream processing, which continuously re-optimizes the query execution plan based on data an...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Comput. Syst. Sci.

دوره 79  شماره 

صفحات  -

تاریخ انتشار 2013