Bug 393381 - Partitioning should to be accompanied by parallel processing
Summary: Partitioning should to be accompanied by parallel processing
Status: NEW
Alias: None
Product: z_Archived
Classification: Eclipse Foundation
Component: Eclipselink (show other bugs)
Version: unspecified   Edit
Hardware: All All
: P3 enhancement (vote)
Target Milestone: ---   Edit
Assignee: Project Inbox CLA
QA Contact:
URL:
Whiteboard:
Keywords: performance
Depends on:
Blocks:
 
Reported: 2012-11-01 18:18 EDT by Miroslav Kandic CLA
Modified: 2022-06-09 10:05 EDT (History)
1 user (show)

See Also:


Attachments

Note You need to log in before you can comment on or make changes to this bug.
Description Miroslav Kandic CLA 2012-11-01 18:18:48 EDT
One of the major reasons we partition and replicate data is to improve scalability (and availability) applying parallel processing against partitions/replicas (kind of map-reduce).
EclipseLink should run in parallel at least the queries in case of "replication-partitioning" and "union-partitioning" policies. Ideally, it should do also manipulative operations in parallel.

With the current implementation a query against partitioned data will be slower than the same query when all data are in the same DB instance because of latency, context switching, etc.
If EclipseLink runs the same query in parallel, in general, it should be faster than traditional RDB which has all data in one DB instance.
Comment 1 Eclipse Webmaster CLA 2022-06-09 10:05:45 EDT
The Eclipselink project has moved to Github: https://github.com/eclipse-ee4j/eclipselink