Results 1 - 10
of
381
Parallelizing skyline queries for scalable distribution
- In EDBT’06
, 2006
"... Abstract. Skyline queries help users make intelligent decisions over complex data, where different and often conflicting criteria are considered. Current skyline computation methods are restricted to centralized query processors, limiting scalability and imposing a single point of failure. In this p ..."
Abstract
-
Cited by 51 (2 self)
- Add to MetaCart
. In this paper, we address the problem of parallelizing skyline query execution over a large number of machines by leveraging content-based data partitioning. We present a novel distributed skyline query processing algorithm (DSL) that discovers skyline points progressively. We propose two mechanisms, recursive
High performance OLAP and data mining on parallel computers
- Journal of Data Mining and Knowledge Discovery
, 1997
"... Abstract. On-Line Analytical Processing (OLAP) techniques are increasingly being used in decision support systems to provide analysis of data. Queries posed on such systems are quite complex and require different views of data. Analytical models need to capture the multidimensionality of the underly ..."
Abstract
-
Cited by 51 (6 self)
- Add to MetaCart
-memory parallel computers. Data is loaded from a relational database into a multidimensional array. We present two methods, sort-based and hash-based for loading the base cube and compare their performances. Data cubes are used to perform consolidation queries used in roll-up operations using dimension
Transactions on Parallel and Distributed Systems
"... (MMOGs) can include millions of concurrent players spread across the world and interacting with each other within a single session. Faced with high resource demand variability and with misfit resource renting policies, the current industry practice is to over-provision for each game tens of self-own ..."
Abstract
- Add to MetaCart
-owned data centres, making the market entry affordable only for big companies. Focusing on the reduction of entry and operational costs, we investigate a new dynamic resource provisioning method for MMOG operation using external data centres as low-cost resource providers. First, we identify in the various
Parallel Processing of Recursive Queries in Distributed Architectures
"... This paper presents a parallel algorithm for recursive query processing and shows how it can be efficiently implemented in a local computer network. The algo-rithm relies on an interpretive approach where recur-sive rule processing and data retrieval are merged in a top-down computation. It employs ..."
Abstract
- Add to MetaCart
This paper presents a parallel algorithm for recursive query processing and shows how it can be efficiently implemented in a local computer network. The algo-rithm relies on an interpretive approach where recur-sive rule processing and data retrieval are merged in a top-down computation. It employs
Query Evaluation with Constant Delay
"... I am grateful to Luc Segoufin who kindly accepted me to be his PhD student. He introduced me to the problem of query enumeration and encouraged me to look for the answers to all the questions that emerged during our collaboration. He was a truly great advisor, always supportive and available for dis ..."
Abstract
- Add to MetaCart
I am grateful to Luc Segoufin who kindly accepted me to be his PhD student. He introduced me to the problem of query enumeration and encouraged me to look for the answers to all the questions that emerged during our collaboration. He was a truly great advisor, always supportive and available
CONTRIBUTIONS TO PARALLEL AND DISTRIBUTED COMPUTING IN KNOWLEDGE DISCOVERY AND DATA MINING
, 2006
"... Recently databases are increasing continuously without bound, due to new data acquisition technologies. One challenge is how to gain knowledge from these large data sets. In this thesis, we analyze and improve the algorithmic solution of four problems related to knowledge discovery and data mining, ..."
Abstract
- Add to MetaCart
, making use of parallel computing; we also compare our results with related works. We design two parallel algorithms for outlier detection; the first one is for finding distance-based outliers based on nested loops along with randomization and the use of a pruning rule. The second parallel algorithm
Results 1 - 10
of
381