Filters








8 Hits in 4.6 sec

Scalability analysis of declustering methods for multidimensional range queries

B. Moon, J.H. Saltz
1998 IEEE Transactions on Knowledge and Data Engineering  
Although the scalability of the declustering methods becomes increasingly important for systems equipped with a large number of disks, no analytic studies have been done so far.  ...  Efficient storage and retrieval of multiattribute data sets has become one of the essential requirements for many data-intensive applications.  ...  The authors assume all responsibility for the contents of the paper.  ... 
doi:10.1109/69.683759 fatcat:jzywvt75b5afdfwntampfqawya

Algorithms for loading parallel grid files

Jianzhong Li, Doron Rotem, Jaideep Srivastava
1993 Proceedings of the 1993 ACM SIGMOD international conference on Management of data - SIGMOD '93  
The paper describes three fast loading algorithms for grid files on a parallel shared nothing architecture.  ...  The algorithms use dynamic programming g and sampling to effectively partition the data file among the processors to achieve maximum parallelism in answering range queries.  ...  Multidimensional Data Declustering for Grid Files Multidimensional declustering is a partitioning scheme which determines which part of the data will reside on each processing node.  ... 
doi:10.1145/170035.170086 dblp:conf/sigmod/LiRS93 fatcat:64zocrbmpbbcrc5pxuuketdyym

Algorithms for loading parallel grid files

Jianzhong Li, Doron Rotem, Jaideep Srivastava
1993 SIGMOD record  
The paper describes three fast loading algorithms for grid files on a parallel shared nothing architecture.  ...  The algorithms use dynamic programming g and sampling to effectively partition the data file among the processors to achieve maximum parallelism in answering range queries.  ...  Multidimensional Data Declustering for Grid Files Multidimensional declustering is a partitioning scheme which determines which part of the data will reside on each processing node.  ... 
doi:10.1145/170036.170086 fatcat:dypujxr7xvhebpqkvljpknleey

Efficient disk allocation for fast similarity searching

Sunil Prabhakar, Divyakant Agrawal, Amr El Abbadi
1998 Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures - SPAA '98  
In this paper, we propose a new scheme which provides good declustering for similarity searching.  ...  Recently, declustering techniques have been proposed for improving the performance of similarity searches through parallel I/O.  ...  In this paper, a new disk allocation method for declustering high-dimensional data to optimize nearest-neighbor queries is developed.  ... 
doi:10.1145/277651.277674 dblp:conf/spaa/PrabhakarAA98 fatcat:aqvxoor6szadfdzgj3nxr2ysxq

Efficient retrieval of multidimensional datasets through parallel I/O

S. Prabhakar, K. Abdel-Ghaffar, D. Agrawal, A. El Abbadi
Proceedings. Fifth International Conference on High Performance Computing (Cat. No. 98EX238)  
Several schemes for declustering multidimensional data to improve the performance of range queries have been proposed in the literature.  ...  Tiling and distributing the data across multiple disks is an effective technique for improving performance through parallel I/O.  ...  The allocation of the data to disks is left to the parallel file system.  ... 
doi:10.1109/hipc.1998.738011 dblp:conf/hipc/PrabhakarAAA98 fatcat:bwxdyd2e4vfdzevcxuott4jgbe

Low dimensional visualization and modelling of data using distance-based models

Gina Grünhage, Technische Universität Berlin, Technische Universität Berlin, Manfred Opper, Simon Barthelme
2018
Here, a method called continuous multi-dimensional scaling (cMDS) is proposed, which allows to visualize the changes in the data structure in a simple and efficient way as the distance function varies.  ...  This thesis consists of two parts, which seek low-dimensional representations for visualization and analysis of data. Both parts use rather different types of models and inference methods.  ...  I compare cMDS to a rudimentary method of tracking the influence of changing distances on the data structure.  ... 
doi:10.14279/depositonce-7824 fatcat:qsb47vg34rdb7hvxk6qj3opzzq

ARCHITECTURE OF PARALLEL DATABASE TO MAKE FUTURE DATABASE PROCESSING HIGH

E Vijayan, N Senthil Kumar, Navneet Shukla, Rudra Dwivedi
2016 International Journal of Pharmacy & Technology   unpublished
Architecture modeling of parallel database framework comprising of unusual hardware has been replaced by a parallel-dataflow structure which is in view of normal imparted nothing equipment.  ...  In this paper we will examine a strategy utilized by such framework and exploration based framework.  ...  A quick PC (with quick chip) is one of the ideal stage for Parallel-Database-System.  ... 
fatcat:6fms6l4kxfgt3k63f3ye4he6gm

79. Jahrestagung Deutsche Geophysikalische Gesellschaft. 04.-07. März 2019 in Braunschweig. Abstracts und Autorenverzeichnis

Deutsche Geophysikalische Gesellschaft
2019
: Multidimensional Inversion of long offset CSEM data in time and frequency domain W.  ...  Subsequently, a multidimensional inversion of the dataset in frequency domain was carried out, including electrical and magnetic (SQUID) field data.  ...  The strike direction of one nodal plane (almost N-S) reflects the strike of the Marianske Lazne fault zone and parallel striking fault systems.  ... 
doi:10.2312/dgg79 fatcat:563ocnmvdfegxeryz62pncganm