zweidimensionales bewegtes Bild
vChain: Enabling Verifiable Boolean Range Queries over Blockchain Databases
- Standort
-
Hannover TIB
- Umfang
-
341MB, 00:16:29:14 (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
-
Xu, Cheng
Zhang, Ce
Xu, Jianliang
- DOI
-
10.5446/42865
- 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
- Xu, Cheng
- Zhang, Ce
- Xu, Jianliang
- ACM SIGMOD
Entstanden
- 2019-01-01
Ähnliche Objekte (12)
Compiling Existential Positive Queries to Bounded-Variable Fragments
A Scalable Index for Top-k Subtree Similarity Queries
On the Enumeration Complexity of Unions of Conjunctive Queries
Top-k Queries over Digital Traces
Explaining Wrong Queries Using Small Examples
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
Compiling Existential Positive Queries to Bounded-Variable Fragments
A Scalable Index for Top-k Subtree Similarity Queries
On the Enumeration Complexity of Unions of Conjunctive Queries
Top-k Queries over Digital Traces
Explaining Wrong Queries Using Small Examples
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
Compiling Existential Positive Queries to Bounded-Variable Fragments
A Scalable Index for Top-k Subtree Similarity Queries
On the Enumeration Complexity of Unions of Conjunctive Queries
Top-k Queries over Digital Traces
Explaining Wrong Queries Using Small Examples
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