Lower bounds for processing data with few random accesses to external memory (Q3452210)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Lower bounds for processing data with few random accesses to external memory |
scientific article; zbMATH DE number 6507190
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lower bounds for processing data with few random accesses to external memory |
scientific article; zbMATH DE number 6507190 |
Statements
Lower bounds for processing data with few random accesses to external memory (English)
0 references
11 November 2015
0 references
complexity
0 references
XML
0 references
data streams
0 references
query optimization
0 references
query processing
0 references
real-time data
0 references
semi-structured data
0 references
0.8533533811569214
0 references
0.8287273049354553
0 references
0.8283737897872925
0 references
0.7568629384040833
0 references
0.7536449432373047
0 references
