zweidimensionales bewegtes Bild
LSM-Trees and B-Trees: The Best of Both Worlds
- Standort
-
Hannover TIB
- Umfang
-
239MB, 00:07:46:23 (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
-
Jain, Varun
Lennon, James
Gupta, Harshita
- DOI
-
10.5446/42855
- 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
- Jain, Varun
- Lennon, James
- Gupta, Harshita
- ACM SIGMOD
Entstanden
- 2019-01-01
Ähnliche Objekte (12)
Designing Distributed Tree-based Index Structures for Fast RDMA-capable Networks
Enumeration on Trees with Tractable Combined Complexity and Efficient Updates
FITing-Tree: A Data-aware Index Structure
Query-Driven Learning for Next Generation Predictive Modeling and Analytics
Exact Cardinality Query Optimization with Bounded Execution Cost
The Selfish Models Property: Bounding the Complexity of Query Containment and Entailment Problems
Responsible Data Science
Topic Pages: From Articles to Answers
Ceres: Harvesting knowledge from the semi-structured web
Fingerprints for Compressed Columnar Data Search
SIGMOD Test-Of-Time Award Talk: Building Tools for Differentially Private Data Analysis
Infrastructure for Machine Learning: Ideas from Industry and Research
Designing Distributed Tree-based Index Structures for Fast RDMA-capable Networks
Enumeration on Trees with Tractable Combined Complexity and Efficient Updates
FITing-Tree: A Data-aware Index Structure
Query-Driven Learning for Next Generation Predictive Modeling and Analytics
Exact Cardinality Query Optimization with Bounded Execution Cost
The Selfish Models Property: Bounding the Complexity of Query Containment and Entailment Problems
Responsible Data Science
Topic Pages: From Articles to Answers
Ceres: Harvesting knowledge from the semi-structured web
Fingerprints for Compressed Columnar Data Search
SIGMOD Test-Of-Time Award Talk: Building Tools for Differentially Private Data Analysis
Infrastructure for Machine Learning: Ideas from Industry and Research
Designing Distributed Tree-based Index Structures for Fast RDMA-capable Networks
Enumeration on Trees with Tractable Combined Complexity and Efficient Updates
FITing-Tree: A Data-aware Index Structure
Query-Driven Learning for Next Generation Predictive Modeling and Analytics
Exact Cardinality Query Optimization with Bounded Execution Cost
The Selfish Models Property: Bounding the Complexity of Query Containment and Entailment Problems
Responsible Data Science
Topic Pages: From Articles to Answers
Ceres: Harvesting knowledge from the semi-structured web
Fingerprints for Compressed Columnar Data Search
SIGMOD Test-Of-Time Award Talk: Building Tools for Differentially Private Data Analysis