16,708 Hits in 4.6 sec


Mohamed Chakraoui
2016 International Journal of GEOMATE  
parallel/distributed database systems and collaboration between processors when executing multi-queries.  ...  The widespread growth of data has created many problems for businesses, such as delay requests; in this paper, we propose several methods of partitioning an index B*Tree in multi-processor machines in  ...  The shared-disk architecture is not very effective for database systems.  ... 
doi:10.21660/2016.27.1322 fatcat:dsifoha6cnfhddxkkwqujufz5u

Analysis of parallel scan processing in Shared Disk database systems [chapter]

Erhard Rahm, Thomas Stöhr
1995 Lecture Notes in Computer Science  
Finally, we show that disk contention in multi-user mode can be limited for Shared Disk database systems by dynamically choosing the degree of scan parallelism.  ...  Shared Disk database systems offer a high flexibility for parallel transaction and query processing.  ...  This approach partitions the global lock authority (GLA) for the database among processing nodes so that each node handles all global lock requests for one database partition.  ... 
doi:10.1007/bfb0020487 fatcat:njrgyqxdfzf37jmdyarp26wcdy

Dynamic load balancing in parallel database systems [chapter]

Erhard Rahm
1996 Lecture Notes in Computer Science  
Dynamic load balancing is a prerequisite for effectively utilizing large parallel database systems.  ...  For this purpose, we focus on parallel scan and join processing in multi-user mode.  ...  Figure 1 : 1 Architecture of parallel database systems -Shared Everything (SE, Figure 3 : 3 Parallel scan processing in SN systems(multi-user mode) Figure 4 : 4 Optimal number of join processors  ... 
doi:10.1007/3-540-61626-8_4 fatcat:cuktfn5tsvgtljcjzo23vtlgp4

Parallel query processing in shared disk database systems

Erhard Rahm
1993 SIGMOD record  
Multiprocessors are already utilized by several commercial DBMS for parallelizing certain operations (e.g., index constructionimaintenance or sorting) [Ha90, Da92].  ...  Consequently, the number of processors is quite low in current SE systems(:> 30).  ...  Problems with parallel update transactions In SN systems, the separation of global transactions into subtransactions is detennined by the database allocation.  ... 
doi:10.1145/166635.166649 fatcat:ky6omhxokjexffwmbx4is4x34e

On the performance of parallel join processing in shared nothing database systems [chapter]

Robert Marek, Erhard Rahm
1993 Lecture Notes in Computer Science  
Shared nothing systems represent the major architecture for parallel database processing.  ...  Parallel database systems aim at providing high throughput for OLTP transactions as well as short response times for complex and data-intensive queries.  ...  Introduction Parallel database systems are the key to high performance transaction and database processing [DG92] .  ... 
doi:10.1007/3-540-56891-3_50 fatcat:c4yphstgpbefro3l2vnzdnbrpy

Scalable Visual Analytics of Massive Textual Datasets

M. Krishnan, S. Bohn, W. Cowley, V. Crow, J. Nieplocha
2007 2007 IEEE International Parallel and Distributed Processing Symposium  
The paper describes key elements of our parallelization approach and demonstrates virtually linear scaling when processing multi-gigabyte data sets such as Pubmed.  ...  By developing a parallel implementation of the text processing engine, we enabled visual analytics tools to exploit cluster architectures and handle massive datasets.  ...  Indexing The indexing component comprises Parallel Inverted File Indexing (IFI) and Global term statistics.  ... 
doi:10.1109/ipdps.2007.370232 dblp:conf/ipps/KrishnanBCCN07 fatcat:tkcnjcravza5fm4r2awbn3wcqi

A Parallel Algorithm Based on Prefix Tree for Sequence Pattern Mining

Jia-dong Ren, Yuan Dong, Hai-tao He
2010 2010 First ACIS International Symposium on Cryptography, and Network Security, Data Mining and Knowledge Discovery, E-Commerce and Its Applications, and Embedded Systems  
PTPSPM algorithm applies project database identifier index table of dynamic scheduling to avoid the processor idle waiting.  ...  Algorithm PTPSPM (a parallel algorithm based on prefix tree for sequence pattern mining) is proposed in order to deal with the speed limited and effectiveness problem of the sequence pattern mining in  ...  of the parallel mining platform from distributed systems to multi-core system; Wu proposed EDMA [6] algorithm to mine association rules, it minimized the number of candidate sets, exchanged messages  ... 
doi:10.1109/cdee.2010.10 fatcat:endgaqojlnhqzbvyqgksezovp4

Parallel Implementation Strategy for Content Based Video Copy Detection Using a Multi-core Processor

2014 KSII Transactions on Internet and Information Systems  
In this paper, we propose a parallel implementation strategy for content based video copy detection (CBCD) by using a multi-core processor.  ...  Video copy detection methods have emerged in recent years for a variety of applications. However, the lack of efficiency in the usual retrieval systems restricts their use.  ...  In this paper, we propose a parallel implementation strategy for CBCD by using a multi-core processor.  ... 
doi:10.3837/tiis.2014.10.014 fatcat:e6czcbeozrgftk2swnjlzm5lci

Parallel query processing on distributed clustering indexes

Veronica Gil-Costa, Mauricio Marin, Nora Reyes
2009 Journal of Discrete Algorithms  
However, in large-scale systems such as Web Search Engines indexing multi-media content, it is critical to deal efficiently with streams of queries rather than with single queries.  ...  Similarity search has been proved suitable for searching in large collections of unstructured data objects. A number of practical index data structures for this purpose have been proposed.  ...  Global index global centers local objects (GGL-T) . This is a more practical realization of GG in terms of the cost of index construction in very large databases.  ... 
doi:10.1016/j.jda.2008.09.010 fatcat:tyvgoy7ecrdehe626q6wjvdo4i

Database servers tailored to improve energy efficiency

Goetz Graefe
2008 Proceedings of the 2008 EDBT workshop on Software engineering for tailor-made data management - SETMDM '08  
This brief paper collects issues and techniques required or desirable for making a server-class database management system energy-efficient.  ...  Database software can be tailored for specific application domains and their required functionality, for specific hardware and its characteristics, or for other purposes.  ...  This is very fortunate given the recent hardware trends towards multi-core processors. For optimal energy efficiency, very dynamic control of the degree of parallelism seems required.  ... 
doi:10.1145/1385486.1385494 fatcat:wzhgrlzefndabixa5lomnfzufe

Parallel data intensive computing in scientific and commercial applications

Mario Cannataro, Domenico Talia, Pradip K Srimani
2002 Parallel Computing  
The integration of parallel and distributed computational environments will produce major improvements in performance for both computing intensive and data intensive applications in the future.  ...  performance computation, very large data storage, high bandwidth access, and high-speed local and wide area networking, data intensive computing enhances the technical capabilities and usefulness of most systems  ...  Gerhard Joubert for many helpful suggestions that improved the contents and the presentation of this paper.  ... 
doi:10.1016/s0167-8191(02)00091-1 fatcat:qetjnt73xrbf3eil5p6suwx4ua

Performance analysis of "Groupby-After-Join" query processing in parallel database systems

David Taniar, Rebecca Boon-Noi Tan, C.H.C. Leung, K.H. Liu
2004 Information Sciences  
., "Global Parallel Indexing for Multi-Processors Database Systems", Information Sciences, Elsevier, vol. 165, no. 1-2, pp. 103-127, 2004.  ...  ., "Performance Analysis of Groupby-After-Join Query Processing in Parallel Database Systems", Information Sciences, Elsevier, vol. 168, no. 1-4, pp. 25-50, 2004 ISI ® Impact Factor: 2005 = 0.723 ISI  ... 
doi:10.1016/j.ins.2003.09.029 fatcat:sqjxvp44infnbdys6zg62gdmui

Accelerating database operators using a network processor

Brian Gold, Anastassia Ailamaki, Larry Huston, Babak Falsafi
2005 Proceedings of the 1st international workshop on Data management on new hardware - DAMON '05  
This paper shows an existing hardware architecture-the network processor-already fits the model for multi-threaded, multi-core execution.  ...  Database management systems (DBMSs) do not take full advantage of modern microarchitectural resources, such as wide-issue out-of-order processor pipelines.  ...  ACKNOWLEDGEMENTS The authors would like to thank Jared Smolens for help with early versions of this work, Minglong Shao for help with Shore, and members of the Carnegie Mellon Impetus group  ... 
doi:10.1145/1114252.1114260 fatcat:dm7ub4pxhrhkrpdcrsb6jzo6ea

Querying very large multi-dimensional datasets in ADR

Tahsin Kurc, Chialin Chang, Renato Ferreira, Alan Sussman, Joel Saltz
1999 Proceedings of the 1999 ACM/IEEE conference on Supercomputing (CDROM) - Supercomputing '99  
We have developed an infrastructure, called the Active Data Repository (ADR), that integrates storage, retrieval and processing of multi-dimensional datasets on distributed-memory parallel architectures  ...  In these applications, datasets are often multi-dimensional, i.e., data items are associated with points in a multi-dimensional attribute space, and access to data items is described by range queries.  ...  Parallel database systems have been a major topic in the database community [10] for a long time, and much attention has been devoted to the implementation and scheduling of parallel joins [22, 27]  ... 
doi:10.1145/331532.331544 dblp:conf/sc/KurcCFSS99 fatcat:em7nbr3pcjbrbjnotaslsiq3bi

Frequent Pattern-growth Algorithm on Multi-core CPU and GPU Processors

Khedija Arour, Amani Belkahla
2014 Journal of Computing and Information Technology  
Utilizing parallel architectures has been a viable means for improving FIM algorithms performance.  ...  We present two FP-growth implementations that take advantage of multi-core processors and utilize new generation Graphic Processing Units (GPU).  ...  CPU Parallel Implementation We describe in this section the FP-growth implementation for multi-core processor.  ... 
doi:10.2498/cit.1002361 fatcat:nqj7jpc77naa5oebtjtetjtd6a
« Previous Showing results 1 — 15 out of 16,708 results