Optimism analysis of parallel queries in databases through multicores

Mohankumar, P.; Kumaresan, P; Vaideeswaran, J.

doi:10.5121/ijdms.2011.3110

Cited by 2 publications

(1 citation statement)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There is a vast literature on query processing and load balancing in parallel database systems (e.g., [12][13][14]) and distributed databases (e.g., [15][16][17]). In [15] it is discussed the potential of parallel processing in the data warehouse loading process and for the maintenance of materialized views.…”

Section: Related Workmentioning

confidence: 99%

Cost-Effective Data Allocation in Data Warehouse Striping

Almeida¹

2012

IJDMS

View full text Add to dashboard Cite

The Data Warehouse Striping (DWS) technique is a data partitioning approach especially designed for distributed data warehousing environments. In DWS the fact tables are distributed by an arbitrary number of low-cost computers and each query is executed in parallel by all the computers, guarantying a nearly optimal speed up and scale up. Data loading in distributed data warehouses is typically a heavy process and brings the need for loading algorithms that conciliate a balanced distribution of data among nodes with an efficient data allocation. These are fundamental aspects to achieve low and uniform response times and, consequently, high performance during the execution of queries. This paper proposes a generic approach for the evaluation of data distribution algorithms and assesses several alternative algorithms in the context of DWS. The experimental results show that the effective loading of the nodes must consider complementary effects, minimizing the number of distinct keys of any large dimension in the fact tables in each node, as well as splitting correlated rows among the nodes.

show abstract

Section: Related Workmentioning

confidence: 99%

Cost-Effective Data Allocation in Data Warehouse Striping

Almeida¹

2012

IJDMS

View full text Add to dashboard Cite

show abstract

Object Oriented Query Response Time for UML Models

Saxena¹,

Kumar²

2012

JSEA

View full text Add to dashboard Cite

Nowadays, the size of database of any business organization is increasing and many of the companies are shifted the old structured database into the object oriented database. Due to increase of size of database complexity of database is increasing therefore, it is necessary to optimize the object oriented query response time from the complex object oriented database. In the present paper, a real case study of Life Insurance Corporation of India is taken and sample object oriented database is designed by the use of SQL Server 2008. A UML model is designed for computing the object oriented query response time. Table and graph are also represented for the computed records in five runs.

show abstract

Optimism analysis of parallel queries in databases through multicores

Cited by 2 publications

References 0 publications

Cost-Effective Data Allocation in Data Warehouse Striping

Cost-Effective Data Allocation in Data Warehouse Striping

Object Oriented Query Response Time for UML Models

Contact Info

Product

Resources

About