Sciweavers

6905 search results - page 1161 / 1381
» Querying Multidimensional Databases
Sort
View
SIGMOD
2004
ACM
149views Database» more  SIGMOD 2004»
16 years 2 months ago
Incremental Maintenance of XML Structural Indexes
Increasing popularity of XML in recent years has generated much interest in query processing over graph-structured data. To support efficient evaluation of path expressions, many ...
Ke Yi, Hao He, Ioana Stanoi, Jun Yang 0001
SIGMOD
2003
ACM
158views Database» more  SIGMOD 2003»
16 years 2 months ago
Processing Set Expressions over Continuous Update Streams
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In ...
Sumit Ganguly, Minos N. Garofalakis, Rajeev Rastog...
PODS
2005
ACM
164views Database» more  PODS 2005»
16 years 2 months ago
Lower bounds for sorting with few random accesses to external memory
We consider a scenario where we want to query a large dataset that is stored in external memory and does not fit into main memory. The most constrained resources in such a situati...
Martin Grohe, Nicole Schweikardt
PODS
2006
ACM
95views Database» more  PODS 2006»
16 years 2 months ago
Randomized computations on large data sets: tight lower bounds
We study the randomized version of a computation model (introduced in [9, 10]) that restricts random access to external memory and internal memory space. Essentially, this model c...
André Hernich, Martin Grohe, Nicole Schweik...
158
Voted
EDBT
2004
ACM
174views Database» more  EDBT 2004»
16 years 2 months ago
Processing Data-Stream Join Aggregates Using Skimmed Sketches
There is a growing interest in on-line algorithms for analyzing and querying data streams, that examine each stream element only once and have at their disposal, only a limited amo...
Sumit Ganguly, Minos N. Garofalakis, Rajeev Rastog...
« Prev « First page 1161 / 1381 Last » Next »