Sciweavers

238 search results - page 7 / 48
» Optimistic parallelism benefits from data partitioning
Sort
View
SDM
2009
SIAM
167views Data Mining» more  SDM 2009»
14 years 4 months ago
Parallel Pairwise Clustering.
Given the pairwise affinity relations associated with a set of data items, the goal of a clustering algorithm is to automatically partition the data into a small number of homogen...
Elad Yom-Tov, Noam Slonim
IPPS
2007
IEEE
14 years 1 months ago
Availability/Consistency Balancing Replication Model
Replication combined with explicit management of data integrity constraints can be used to enhance availability of object-oriented, data-centric distributed systems when node and ...
Johannes Osrael, Lorenz Froihofer, Karl M. Gö...
ESCIENCE
2007
IEEE
14 years 1 months ago
Community Training: Partitioning Schemes in Good Shape for Federated Data Grids
In federated Data Grids, individual institutions share their data sets within a community to enable collaborative data analysis. Data access needs to be provided in a scalable fas...
Tobias Scholl, Richard Kuntschke, Angelika Reiser,...
TKDE
2002
148views more  TKDE 2002»
13 years 7 months ago
Parallel Star Join + DataIndexes: Efficient Query Processing in Data Warehouses and OLAP
On-Line Analytical Processing (OLAP) refers to the technologies that allow users to efficiently retrieve data from the data warehouse for decision-support purposes. Data warehouses...
Anindya Datta, Debra E. VanderMeer, Krithi Ramamri...
ICDE
2010
IEEE
224views Database» more  ICDE 2010»
13 years 7 months ago
Partitioning real-time ETL workflows
—Many organizations are aiming to move away from traditional batch processing ETL to real-time ETL (RT-ETL). This move is motivated by a need to analyze and take decisions on as ...
Alkis Simitsis, Chetan Gupta, Song Wang, Umeshwar ...