article

Free access

Locking Expressions for Increased Database Concurrency

Author:

Anthony KlugAuthors Info & Claims

Journal of the ACM (JACM), Volume 30, Issue 1

Pages 36 - 54

https://doi.org/10.1145/322358.322362

Published: 01 January 1983 Publication History

PDF eReader

References

[1]

AHO, A V., SAGIV, Y., AND ULLMAN, J.D.Efficient optunization of a class of relational expressions. ACM Trans. Database Syst. 4, 4 (Dec 1979), 435-454.

Crossref

Google Scholar

[2]

AHo, A V., SAc;Iv, Y., AND ULLMAN, J D.Equivalence of relatmnal expressions. SIAM ~ Comput. 8, 2 (May 1979), 218-246.

Google Scholar

[3]

BERNSTEIN, P.A, AND GOODMAN, N.The theory of semi-joins. Tech Rep CCA-79-27, Computer Corporation of America, Boston, Mass, 1979.

Google Scholar

[4]

BERNSTEIN, P A., AND GOODMAN, N.Fundamental algorithms for concurrency control m distributed database systems. Tech. Rep. CCA-80-05, Computer Corporatmn of America, Boston, Mass., 1980.

Google Scholar

[5]

CHANDRA, A.K., AND MERLIN, P M.Optunal unplementation of conjuncnve queries in relational databases. Proc 9th Ann. ACM Symp. on Theory of Computing, Boulder, Colo., May 1977, pp. 77-90

Crossref

Google Scholar

[6]

CODD, E.F Relational completeness of data base sublanguages. In Data Base Systems, R. Rustin, Ed., Prentice Hall, Englewood Chffs, N.J, 1972.

Google Scholar

[7]

ESWARAN, K.P., GRAY, J.N, LORIE, R A, AND TRAIGER, I.L The notions of consistency and predicate locks in a database system Commun. ACM 19, 11 (Nov. 1976), 624--633.

Crossref

Google Scholar

[8]

KLUG, A., AND PRICE, R. Determining view dependencies usmg tableaux A CM Trans. Database Syst. (to appear)

Crossref

Google Scholar

[9]

MAIER, D., MENDELZON, A O., AND SAGIV, Y.Testing imphcatlons of data dependencies. A CM Trans. Database Syst. 4, 4 (Dec. 1979), 455-469.

Crossref

Google Scholar

[10]

PAPADIMITRIOU, C.H.The serializabllity of concurrent database updates. J A CM 26, 4 (Oct 1979), 631-653.

Crossref

Google Scholar

[11]

SAGIv, Y., ANt) YANNAKAKIS, M.Equivalences among relational expressions with the union and difference operators. ~ A CM 27, 4 (Oct. 1980), 633-655.

Crossref

Google Scholar

[12]

WONG, K C., AND EDELBERG, M.Interval hmrarchms and their applicaUon to predmate files A CM Trans Database Syst. 2, 3 (Sept 1977), 223-232.

Crossref

Google Scholar

Cited By

View all

Hegner S(2010)A model of independence and overlap for transactions on database schemataProceedings of the 14th east European conference on Advances in databases and information systems10.5555/1885872.1885891(204-218)Online publication date: 20-Sep-2010
https://dl.acm.org/doi/10.5555/1885872.1885891
Hegner S(2010)A Model of Independence and Overlap for Transactions on Database SchemataAdvances in Databases and Information Systems10.1007/978-3-642-15576-5_17(204-218)Online publication date: 2010
https://doi.org/10.1007/978-3-642-15576-5_17
Meghini CThanos C(1996)An Optimal Predicate Locking SchedulerJournal of Computer and System Sciences10.1006/jcss.1996.008053:3(443-468)Online publication date: 1-Dec-1996
https://dl.acm.org/doi/10.1006/jcss.1996.0080
Show More Cited By

Index Terms

Locking Expressions for Increased Database Concurrency

Recommendations

Dependence-aware transactional memory for increased concurrency
MICRO 41: Proceedings of the 41st annual IEEE/ACM International Symposium on Microarchitecture

Transactional memory (TM) is a promising paradigm for helping programmers take advantage of emerging multi-core platforms. Though they perform well under low contention, hardware TM systems have a reputation of not performing well under high contention, ...
Approaches to increasing database concurrency through locking
Concurrency Control by Locking

We present a geometric method for studying concurrency control by locking. When there are only two transactions, our method yields an exact characterization of safe locking policies and also of deadlock-free locking policies. Our results can be extended ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

Journal of the ACM Volume 30, Issue 1

Jan. 1983

228 pages

ISSN:0004-5411

EISSN:1557-735X

DOI:10.1145/322358

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 January 1983

Published in JACM Volume 30, Issue 1

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

12
Total Citations
View Citations
373
Total Downloads

Downloads (Last 12 months)26
Downloads (Last 6 weeks)1

Reflects downloads up to 21 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Hegner S(2010)A model of independence and overlap for transactions on database schemataProceedings of the 14th east European conference on Advances in databases and information systems10.5555/1885872.1885891(204-218)Online publication date: 20-Sep-2010
https://dl.acm.org/doi/10.5555/1885872.1885891
Hegner S(2010)A Model of Independence and Overlap for Transactions on Database SchemataAdvances in Databases and Information Systems10.1007/978-3-642-15576-5_17(204-218)Online publication date: 2010
https://doi.org/10.1007/978-3-642-15576-5_17
Meghini CThanos C(1996)An Optimal Predicate Locking SchedulerJournal of Computer and System Sciences10.1006/jcss.1996.008053:3(443-468)Online publication date: 1-Dec-1996
https://dl.acm.org/doi/10.1006/jcss.1996.0080
Gheith ASchwan K(1993)CHAOSarc: kernel support for multiweight objects, invocations, and atomicity in real-time multiprocessor applicationsACM Transactions on Computer Systems10.1145/151250.15125211:1(33-72)Online publication date: 1-Feb-1993
https://dl.acm.org/doi/10.1145/151250.151252
Elkan CRosenkrantz DSagiv Y(1990)Independence of logic database queries and updateProceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems10.1145/298514.298557(154-160)Online publication date: 2-Apr-1990
https://dl.acm.org/doi/10.1145/298514.298557
Zedan H(1990)Key references in distributed computer systems 1959–1989Distributed Computer Systems10.1016/B978-0-408-02938-4.50016-4(193-295)Online publication date: 1990
https://doi.org/10.1016/B978-0-408-02938-4.50016-4
Elkan CSilberschatz A(1989)A decision procedure for conjunctive query disjointnessProceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems10.1145/73721.73735(134-139)Online publication date: 29-Mar-1989
https://dl.acm.org/doi/10.1145/73721.73735
Böttcher SJarke MSchmidt J(1986)Adaptive Predicate Managers in Database SystemsProceedings of the 12th International Conference on Very Large Data Bases10.5555/645913.671464(21-29)Online publication date: 25-Aug-1986
https://dl.acm.org/doi/10.5555/645913.671464
Böttcher S(1986)Ein Beweisverfahren für DatenbankprädikateGWAI-8510.1007/978-3-642-71145-9_13(164-175)Online publication date: 1986
https://doi.org/10.1007/978-3-642-71145-9_13
Majster-Cederbaum M(1985)Elimination of redundant operations in relational queries with general selection operatorsComputing10.1007/BF0225183234:4(303-323)Online publication date: 1-Sep-1985
https://dl.acm.org/doi/10.1007/BF02251832
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

References

Cited By

Index Terms

Recommendations

Dependence-aware transactional memory for increased concurrency

Approaches to increasing database concurrency through locking

Concurrency Control by Locking

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations