A Conflict-Free Routing Scheme on Multistage Interconnection Networks
IEEE Transactions on Computers
Parallel database systems: the future of high performance database systems
Communications of the ACM
Query evaluation techniques for large databases
ACM Computing Surveys (CSUR)
Using Z: specification, refinement, and proof
Using Z: specification, refinement, and proof
Eddies: continuously adaptive query processing
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
PRISMA/DB: A Parallel, Main Memory Relational DBMS
IEEE Transactions on Knowledge and Data Engineering
Volcano— An Extensible and Parallel Query Evaluation System
IEEE Transactions on Knowledge and Data Engineering
Approximate join processing over data streams
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Chain: operator scheduling for memory minimization in data stream systems
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Aurora: a new model and architecture for data stream management
The VLDB Journal — The International Journal on Very Large Data Bases
An initial study of overheads of eddies
ACM SIGMOD Record
Adaptive ordering of pipelined stream filters
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Operator scheduling in data stream systems
The VLDB Journal — The International Journal on Very Large Data Bases
Advanced Computer Architecture and Parallel Processing (Wiley Series on Parallel and Distributed Computing)
Dynamic Load Management for Distributed Continuous Query Systems
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
A Novel Multistage Network Architecture with Multicast and Broadcast Capability
The Journal of Supercomputing
Adaptive query processing in data stream management systems
Adaptive query processing in data stream management systems
Preemptive rate-based operator scheduling in a data stream management system
AICCSA '05 Proceedings of the ACS/IEEE 2005 International Conference on Computer Systems and Applications
MapReduce: simplified data processing on large clusters
OSDI'04 Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation - Volume 6
Access and Alignment of Data in an Array Processor
IEEE Transactions on Computers
Tuple routing strategies for distributed eddies
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Operator scheduling in a data stream manager
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
A Survey of Interconnection Networks
Computer
Query-aware partitioning for monitoring massive network data streams
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Scheduling continuous queries in data stream management systems
Proceedings of the VLDB Endowment
Operator-Scheduling Using Dynamic Chain for Continuous-Query Processing
CSSE '08 Proceedings of the 2008 International Conference on Computer Science and Software Engineering - Volume 04
Online Failure Forecast for Fault-Tolerant Data Stream Processing
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
A latency and fault-tolerance optimizer for online parallel query plans
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Efficient dynamic operator placement in a locally distributed continuous query system
ODBASE'06/OTM'06 Proceedings of the 2006 Confederated international conference on On the Move to Meaningful Internet Systems: CoopIS, DOA, GADA, and ODBASE - Volume Part I
Scheduling strategies and their evaluation in a data stream management system
BNCOD'06 Proceedings of the 23rd British National Conference on Databases, conference on Flexible and Efficient Information Handling
| Hi-index | 0.00 |
In this paper, a method for fast processing of data stream tuples in parallel execution of continuous queries over a multiprocessing environment is proposed. A copy of the query plan is assigned to each of processing units in the multiprocessing environment. Dynamic and continuous routing of input data stream tuples among the graph constructed by these copies (called the Query Mega Graph) for each input tuple determines that, after getting processed by each processing unit (e.g., processor), to which next processor it should be forwarded. Selection of the proper next processor is performed such that the destination processor imposes the minimum tuple latency to the corresponding tuple, among all of the alternative processors. The tuple latency is derived from processing, buffering and communication time delay which varies in different practical parallel systems.Parallel system architectures that would be suitable as the desired multiprocessing environment for employing the proposed Dynamic Tuple Routing (DTR) method are considered and analyzed. Also, practical challenges and issues for the proper parallel underlying system are discussed. Implementation of the desired parallel system on multi-core systems is provided and used for evaluating the proposed DTR method. Evaluation results show that the proposed DTR method outperforms similar method such as the Eddies in terms of tuple latency, throughput and tuple loss.