Tight lower bounds for query processing on streaming and external memory data (Q2373746): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: XQuery / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2149268219 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: cs/0505002 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The space complexity of approximating the frequency moments / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the memory requirements of XPath evaluation over XML streams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reversal Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree acceptors and some of their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on communication complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monadic datalog and the expressive power of languages for Web information extraction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414534 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of Computation Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945538 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reversal complexity revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Results on Tape-Bounded Turing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Database Theory - ICDT 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for memory hierarchies. Advanced lectures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selection and sorting with limited storage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3425115 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Query automata over finite trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expressiveness of structured document query languages based on attribute grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of matrix methods to the theory of lower bounds in computational complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized finite automata theory with an application to a decision problem of second-order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385524 / rank
 
Normal rank

Latest revision as of 12:13, 26 June 2024

scientific article
Language Label Description Also known as
English
Tight lower bounds for query processing on streaming and external memory data
scientific article

    Statements

    Tight lower bounds for query processing on streaming and external memory data (English)
    0 references
    0 references
    0 references
    0 references
    16 July 2007
    0 references
    0 references
    data streams
    0 references
    external memory
    0 references
    lower bounds
    0 references
    machine models
    0 references
    XML query languages
    0 references
    0 references
    0 references
    0 references
    0 references