I agree that this site is using cookies. You can find further informations
here
.
X
Login
Merkliste (
0
)
Home
About us
Home About us
Our history
Profile
Press & public relations
Friends
The library in figures
Exhibitions
Projects
Training, internships, careers
Films
Services & Information
Home Services & Information
Lending and interlibrary loans
Returns and renewals
Training and library tours
My Account
Library cards
New to the library?
Download Information
Opening hours
Learning spaces
PC, WLAN, copy, scan and print
Catalogs and collections
Home Catalogs and Collections
Rare books and manuscripts
Digital collections
Subject Areas
Our sites
Home Our sites
Central Library
Law Library (Juridicum)
BB Business and Economics (BB11)
BB Physics and Electrical Engineering
TB Engineering and Social Sciences
TB Economics and Nautical Sciences
TB Music
TB Art & Design
TB Bremerhaven
Contact the library
Home Contact the library
Staff Directory
Open access & publishing
Home Open access & publishing
Reference management: Citavi & RefWorks
Publishing documents
Open Access in Bremen
zur Desktop-Version
Toggle navigation
Merkliste
1 Ergebnisse
1
Handling Highly Contended OLTP Workloads Using Fast Dynamic..:
, In:
Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data
,
Prasaad, Guna
;
Cheung, Alvin
;
Suciu, Dan
- p. 527-542 , 2020
Link:
https://dl.acm.org/doi/10.1145/3318464.3389764
RT T1 <cTitle>Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data</cTitle>: T1 <Title>Handling Highly Contended OLTP Workloads Using Fast Dynamic Partitioning</Title> UL https://suche.suub.uni-bremen.de/peid=acm-3389764&Exemplar=1&LAN=DE A1 Prasaad, Guna A1 Cheung, Alvin A1 Suciu, Dan PB ACM YR 2020 K1 OLTP K1 automatic partitioning K1 concurrent data structures K1 high contention K1 main memory K1 transaction processing K1 Information systems K1 Data management systems K1 Database management system engines K1 Database transaction processing K1 Main memory engines K1 Theory of computation K1 Design and analysis of algorithms K1 Concurrent algorithms SP 527 OP 542 LK http://dx.doi.org/https://dl.acm.org/doi/10.1145/3318464.3389764 DO https://dl.acm.org/doi/10.1145/3318464.3389764 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)
