Filters








111,229 Hits in 3.7 sec

An efficient locking model for concurrency control in OODBS

G Arumugam, M Thangaraj
2005 Data Science Journal  
This model is motivated by a desire to provide high concurrency and low locking overheads in accessing objects.  ...  The proposed model consists of a rich set of lock modes, hash table, lock-based signatures and B+ trees.  ...  ACKNOWLEDGEMENTS We would like to thank F J Smith, the editor-in-chief and the anonymous reviewers whose careful reading and constructive criticisms on the work helped to improve the clarity and content  ... 
doi:10.2481/dsj.4.59 fatcat:qb2moglqovczxhosmxpt2zswje

Concurrency Control in B+-Trees Databases Using Preparatory Operations

Yehudit Mond, Yoav Raz
1985 Very Large Data Bases Conference  
A simple concurrency control mechanism for B+-trees Databases is introduced.  ...  These early operations enable to lock only the current node in the process and its father node, and hence to increase the degree of concurrency relatively to other known mechanisms.  ...  In a multi-user environment, where the database is maintainedas a tree in general, and a B+-tree in particular, several problems arise concerning simultaneous multi-access to the database.  ... 
dblp:conf/vldb/MondR85 fatcat:dow64dqdgzgf3jwflnr355ralq

An Efficient Distributed B-tree Index Method in Cloud Computing

Huang Bin, Peng Yuxing
2015 Open Cybernetics and Systemics Journal  
First, it improves concurrent access by the distributed B-tree high concurrency access method based on node split history.  ...  To support online index and range queries, the Distributed B-tree is adopted to index the mass and rapidly increasing data in cloud computing.  ...  ACKNOWLEDGEMENTS The authors would like to thank for the support by Na  ... 
doi:10.2174/1874110x01408010302 fatcat:crmi3dvogbcn5ndgaotc57kyki

SOMA

Girish Venkataramani, Tiberiu Chelcea, Seth Copen Goldstein, Tobias Bjerregaard
2005 Proceedings of the 3rd IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis - CODES+ISSS '05  
A fundamental bottleneck in any such network is arbitrating between concurrent accesses to a shared memory resource.  ...  To alleviate this bottleneck, SOMA uses an application-specific concurrency analysis technique to predict the dynamic memory parallelism profile of the application.  ...  ACKNOWLEDGMENTS We want to thank the reviewers for their helpful and thorough comments. This research is funded in part by the National Science Foundation under Grants No. CCR-0224022 and No.  ... 
doi:10.1145/1084834.1084894 dblp:conf/codes/VenkataramaniCGB05 fatcat:zj3ykos6nfejtnci7vnxjisxyi

Advanced concurrency control in Java

Pascal Felber, Michael K. Reiter
2002 Concurrency and Computation  
In this paper, we consider 'atomic blocks', a simple and lightweight concurrency control paradigm that enables arbitrary blocks of code to access multiple shared objects in isolation.  ...  This transfer operation must be atomic, in the sense that any other entity accessing these accounts concurrently will  ...  ACKNOWLEDGEMENTS We are grateful to the anonymous reviewers for their helpful comments.  ... 
doi:10.1002/cpe.635 fatcat:w2na2murhvc2rc2md77vylhjvy

Hardware compilation of application-specific memory-access interconnect

G. Venkataramani, T. Bjerregaard, T. Chelcea, S.C. Goldstein
2006 IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems  
Then, it is shown how static analysis of the access patterns can be used to optimize the MAN. One optimization changes the MAN interconnect topology to increase concurrence.  ...  SOMA enables specifications to include arbitrary memory references (e.g., pointers) and allows the memory system to incorporate features that might cause the latency of a memory access to vary dynamically  ...  For example, in Fig. 14(b) , if we assign high priority to accesses C, E, D, F, and G, then the resulting access tree is shown in Fig. 16(b) .  ... 
doi:10.1109/tcad.2006.870411 fatcat:ta6m6ivhabdrdkcebdwinib7gu

Eunomia

Xin Wang, Weihua Zhang, Zhaoguo Wang, Ziyun Wei, Haibo Chen, Wenyun Zhao
2017 Proceedings of the 22nd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming - PPoPP '17  
To validate their effectiveness, we apply such designs to construct a scalable concurrent B+Tree using HTM.  ...  In this paper, we first conduct a detailed analysis on an HTM-based concurrent B+Tree, which uncovers several reasons for excessive HTM aborts induced by both false and true conflicts under contention.  ...  We are grateful to support from the National Key Research and Development Program of China (No. 2016YFB0800104), the National Natural Science Foundation of China (No. 61672160 and 61572314), Shanghai Science  ... 
doi:10.1145/3018743.3018752 fatcat:3u2qd3wztfdullifpf22pcg7em

Performance Evaluation of Main-Memory R-tree Variants [chapter]

Sangyong Hwang, Keunjoo Kwon, Sang K. Cha, Byung S. Lee
2003 Lecture Notes in Computer Science  
As far as we know, our work is the first comprehensive performance study of mainmemory R-tree variants.  ...  We also provide detailed observations of the experimental results, and rationalize them based on the characteristics of the individual trees.  ...  Provided with the two primitive operations, Cha et al. combines the B-link technique with the primitives to support the concurrency control of B+-trees.  ... 
doi:10.1007/978-3-540-45072-6_2 fatcat:5b5tvmlc5rc75ooawp5563ncoa

Bounded Delay and Concurrency for Earliest Query Answering [chapter]

Olivier Gauwin, Joachim Niehren, Sophie Tison
2009 Lecture Notes in Computer Science  
⊛ can be extended to k trees.  ...  need O(2 |A| ) to compute an equivalent automaton w/ safe states we use another technique: recognizable relations between trees. 1 Words Bounded Delay Bounded Concurrency 2 Trees Tree Automata Recognizable  ... 
doi:10.1007/978-3-642-00982-2_30 fatcat:m4tzvl6zo5f4dpm5p53wbrnzjy

A concurrency control protocol for parallel B-tree structures without latch-coupling for explosively growing digital content

Tomohiro Yoshihara, Dai Kobayashi, Haruo Yokota
2008 Proceedings of the 11th international conference on Extending database technology Advances in database technology - EDBT '08  
To handle large amounts of data, it is also important to provide an efficient concurrency control protocol for the parallel B-tree.  ...  The only protocol without latch-coupling is the B-link algorithm, but it is difficult to use the B-link algorithm directly on an entire parallel B-tree structure because it is necessary to guarantee the  ...  Jun Miyazaki of NAIST for his advice on concurrency control for Fat-Btrees and B-link.  ... 
doi:10.1145/1352431.1352451 fatcat:cuo5p5kv6jclnjxav7dw6n7tae

A concurrency control protocol for parallel B-tree structures without latch-coupling for explosively growing digital content

Tomohiro Yoshihara, Dai Kobayashi, Haruo Yokota
2008 Proceedings of the 11th international conference on Extending database technology Advances in database technology - EDBT '08  
To handle large amounts of data, it is also important to provide an efficient concurrency control protocol for the parallel B-tree.  ...  The only protocol without latch-coupling is the B-link algorithm, but it is difficult to use the B-link algorithm directly on an entire parallel B-tree structure because it is necessary to guarantee the  ...  Jun Miyazaki of NAIST for his advice on concurrency control for Fat-Btrees and B-link.  ... 
doi:10.1145/1353343.1353363 dblp:conf/edbt/YoshiharaKY08 fatcat:4zladgolfzcavnqqaqhiqkoqve

Relativistic red-black trees

Philip W. Howard, Jonathan Walpole
2013 Concurrency and Computation  
This approach to sharing memory allows reading to proceed independent of concurrent updates and avoids the need for expensive atomic instructions in reads.  ...  We present a concurrent programming methodology called relativistic programming and illustrate its use in a concurrent red-black tree implementation.  ...  Concurrent red-black trees We use the following definitions to describe concurrent implementations: 1 Unsynchronized access is safe for single threaded or read-only implementations, but not for multi-threaded  ... 
doi:10.1002/cpe.3157 fatcat:mi4fm7gcxvgidgx53oadptipcu

Multiversion concurrency control for the generalized search tree

Walter Binder, Adina Mosincat, Samuel Spycher, Ion Constantinescu, Boi Faltings
2009 Concurrency and Computation  
Many read-intensive systems where fast access to data is more important than the rate at which data can change make use of multidimensional index structures, like the generalized search tree (GiST).  ...  The advantage of this is that the GiST provides a 'template' index structure for most of the tree-based access methods, making it easier to integrate these index structures into databases.  ...  , b to e).  ... 
doi:10.1002/cpe.1387 fatcat:vyqosebp5bherehnxsgidh4dya

Multiversion concurrency control for large-scale service directories

W. Binder, I. Constantinescu, B. Faltings, S. Spycher
2005 Third European Conference on Web Services (ECOWS'05)  
The solution proposed here optimizes towards highly concurrent read accesses that are far more frequent than updates to the stored data. 1  ...  In this paper we describe the implementation of multiversion concurrency control on the Generalized Search Tree (GiST), an index structure introduced by Hellerstein.  ...  For every query, a separate thread can simply be generated to access the latest version of the read tree. However, the write tree is still exposed to the same concurrent access problems as the GiST.  ... 
doi:10.1109/ecows.2005.18 dblp:conf/icws/BinderCFS05 fatcat:efyskv3nqbadfcnbf27lznbhvy

Concurrency Control Protocol for Parallel B-Tree Structures That Improves the Efficiency of Request Transfers and SMOs within a Node

Tomohiro YOSHIHARA, Dai KOBAYASHI, Haruo YOKOTA
2018 IEICE transactions on information and systems  
B-tree.  ...  Many concurrency control protocols for B-trees use latchcoupling because its execution is efficient on a single machine.  ...  Jun Miyazaki of Tokyo Institute of Technology for his advice on concurrency control for Fat-Btrees and B-link.  ... 
doi:10.1587/transinf.2016edp7437 fatcat:2cfsm2bnybdk7njjl6xdd7a3bi
« Previous Showing results 1 — 15 out of 111,229 results