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
Answering (Unions of) Conjunctive Queries using Random Acce..:
, In:
Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems
,
Carmeli, Nofar
;
Zeevi, Shai
;
Berkholz, Christoph
.. - p. 393-409 , 2020
Link:
https://dl.acm.org/doi/10.1145/3375395.3387662
RT T1 <cTitle>Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems</cTitle>: T1 <Title>Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration</Title> UL https://suche.suub.uni-bremen.de/peid=acm-3387662&Exemplar=1&LAN=DE A1 Carmeli, Nofar A1 Zeevi, Shai A1 Berkholz, Christoph A1 Kimelfeld, Benny A1 Schweikardt, Nicole PB ACM YR 2020 K1 complexity K1 enumeration K1 unions of conjunctive queries K1 Theory of computation K1 Theory and algorithms for application domains K1 Database theory K1 Database query languages (principles) K1 Database query processing and optimization (theory) K1 Computational complexity and cryptography K1 Complexity classes SP 393 OP 409 LK http://dx.doi.org/https://dl.acm.org/doi/10.1145/3375395.3387662 DO https://dl.acm.org/doi/10.1145/3375395.3387662 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)
