UGC Approved Journal no 63975(19)
New UGC Peer-Reviewed Rules

ISSN: 2349-5162 | ESTD Year : 2014
Volume 12 | Issue 9 | September 2025

JETIREXPLORE- Search Thousands of research papers



WhatsApp Contact
Click Here

Published in:

Volume 6 Issue 3
March-2019
eISSN: 2349-5162

UGC and ISSN approved 7.95 impact factor UGC Approved Journal no 63975

7.95 impact factor calculated by Google scholar

Unique Identifier

Published Paper ID:
JETIRAL06058


Registration ID:
201378

Page Number

272-275

Share This Article


Jetir RMS

Title

USING RUNTIME DEPENDENCY MINING APPROACH FOR RE-OPTIMIZATION OF DATA STREAM PARTITIONING

Abstract

Data is now getting generated with tremendous use of distributed network and sensor network. This data is processed in terms of streams. In distributed knowledge stream process, a program with multiple queries parallelized by partitioning input streams in keeping with the values of specific attributes, or partitioning keys. By applying completely different partitioning keys to different queries needs re-partitioning. It cause further communication and reduce throughput. Re-partitioning may be avoided by detecting dependencies between the partitioning keys applicable to every question. Existing partitioning optimization ways analyze question query syntax at compile-time to observe inter-key dependencies hence avoid re-partitioning. This work extends those compile-time ways by adding Auto-parallelization. Auto-parallelization technique involves locating regions in the application’s data flow graph that can be replicated at run-time to apply data partitioning, to achieve scale. This work, propose an elastic auto-parallelization solution that can dynamically adjust the number of channels used to achieve high throughput without unnecessarily wasting resources. A runtime re-optimization step supported the mining of temporal approximate dependencies (TADs) between partitioning keys. A small indefinite amount is outlined during this work as a sort of dependency which will be roughly valid over a moving time window. This addresses the profitability problem associated with auto-parallelization of general-purpose distributed DataStream processing applications.

Key Words

Data-Stream Partitioning, Auto-parallelization, Runtime Optimization, TAD

Cite This Article

"USING RUNTIME DEPENDENCY MINING APPROACH FOR RE-OPTIMIZATION OF DATA STREAM PARTITIONING", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.6, Issue 3, page no.272-275, March-2019, Available :http://www.jetir.org/papers/JETIRAL06058.pdf

ISSN


2349-5162 | Impact Factor 7.95 Calculate by Google Scholar

An International Scholarly Open Access Journal, Peer-Reviewed, Refereed Journal Impact Factor 7.95 Calculate by Google Scholar and Semantic Scholar | AI-Powered Research Tool, Multidisciplinary, Monthly, Multilanguage Journal Indexing in All Major Database & Metadata, Citation Generator

Cite This Article

"USING RUNTIME DEPENDENCY MINING APPROACH FOR RE-OPTIMIZATION OF DATA STREAM PARTITIONING", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.6, Issue 3, page no. pp272-275, March-2019, Available at : http://www.jetir.org/papers/JETIRAL06058.pdf

Publication Details

Published Paper ID: JETIRAL06058
Registration ID: 201378
Published In: Volume 6 | Issue 3 | Year March-2019
DOI (Digital Object Identifier):
Page No: 272-275
Country: -, -, - .
Area: Engineering
ISSN Number: 2349-5162
Publisher: IJ Publication


Preview This Article


Downlaod

Click here for Article Preview

Download PDF

Downloads

0002940

Print This Page

Current Call For Paper

Jetir RMS