zweidimensionales bewegtes Bild
Complexity Bounds for Relational Algebra over Document Spanners
- Standort
-
Hannover TIB
- Umfang
-
307MB, 00:14:03:19 (unknown)
- Sprache
-
Englisch
- Anmerkungen
-
Audiovisuelles Material
- Erschienen in
-
SIGMOD 2019 ; (Jan. 2019)
- Ereignis
-
Veröffentlichung
- (wer)
-
ACM SIGMOD
- (wann)
-
2019-01-01
- Beteiligte Personen und Organisationen
-
Peterfreund, Liat
Freydenberger, Dominik
Kimelfeld, Benny
Kröll, Markus
- DOI
-
10.5446/42842
- Letzte Aktualisierung
-
04.12.2024, 08:09 MEZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Technische Informationsbibliothek (TIB). Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Technische Informationsbibliothek (TIB). Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Objekttyp
- zweidimensionales bewegtes Bild
Beteiligte
- Peterfreund, Liat
- Freydenberger, Dominik
- Kimelfeld, Benny
- Kröll, Markus
- ACM SIGMOD
Entstanden
- 2019-01-01
Ähnliche Objekte (12)
The Selfish Models Property: Bounding the Complexity of Query Containment and Entailment Problems
On the Enumeration Complexity of Unions of Conjunctive Queries
Algorithmic Fairness: Measures, Methods and Representations
State of Public and Private Blockchains: Myths and Reality
Approximate Distinct Counts for Billions of Datasets
Remembering the Probabilistic Analysis of Latent Semantic Indexing
Responsible Data Science
Exact Cardinality Query Optimization with Bounded Execution Cost
Database Repairs and Consistent Query Answering: Origins and Further Developments
SIGMOD Edgar F. Codd Innovations Award Talk
SpeakQL: Towards Speech-driven Multimodal Querying
Designing Distributed Tree-based Index Structures for Fast RDMA-capable Networks
The Selfish Models Property: Bounding the Complexity of Query Containment and Entailment Problems
On the Enumeration Complexity of Unions of Conjunctive Queries
Algorithmic Fairness: Measures, Methods and Representations
State of Public and Private Blockchains: Myths and Reality
Approximate Distinct Counts for Billions of Datasets
Remembering the Probabilistic Analysis of Latent Semantic Indexing
Responsible Data Science
Exact Cardinality Query Optimization with Bounded Execution Cost
Database Repairs and Consistent Query Answering: Origins and Further Developments
SIGMOD Edgar F. Codd Innovations Award Talk
SpeakQL: Towards Speech-driven Multimodal Querying
Designing Distributed Tree-based Index Structures for Fast RDMA-capable Networks
The Selfish Models Property: Bounding the Complexity of Query Containment and Entailment Problems
On the Enumeration Complexity of Unions of Conjunctive Queries
Algorithmic Fairness: Measures, Methods and Representations
State of Public and Private Blockchains: Myths and Reality
Approximate Distinct Counts for Billions of Datasets
Remembering the Probabilistic Analysis of Latent Semantic Indexing
Responsible Data Science
Exact Cardinality Query Optimization with Bounded Execution Cost
Database Repairs and Consistent Query Answering: Origins and Further Developments
SIGMOD Edgar F. Codd Innovations Award Talk
SpeakQL: Towards Speech-driven Multimodal Querying