Sciweavers

181 search results - page 35 / 37
» A Query Algebra for Fragmented XML Stream Data
Sort
View
DASFAA
2007
IEEE
165views Database» more  DASFAA 2007»
13 years 10 months ago
Making the Most of Cache Groups
Cache groups are a powerful concept for database caching, which is used to relieve the backend database load and to keep referenced data close to the application programs at the &q...
Andreas Bühmann, Theo Härder
ER
2004
Springer
161views Database» more  ER 2004»
13 years 11 months ago
Towards a Statistically Semantic Web
The envisioned Semantic Web aims to provide richly annotated and explicitly structured Web pages in XML, RDF, or description logics, based upon underlying ontologies and thesauri. ...
Gerhard Weikum, Jens Graupmann, Ralf Schenkel, Mar...
IFIP
2004
Springer
13 years 11 months ago
Behavioural Equivalences for Dynamic Web Data
Peer-to-peer systems, exchanging dynamic documents through Web services, are a simple and effective platform for data integration on the internet. Dynamic documents can contain b...
Sergio Maffeis, Philippa Gardner
ICDE
1999
IEEE
106views Database» more  ICDE 1999»
14 years 7 months ago
Processing Operations with Restrictions in RDBMS without External Sorting: The Tetris Algorithm
Most operations of the relational algebra or SQL require a sorted stream of tuples for efficient processing. Therefore, processing complex relational queries relies on efficient a...
Volker Markl, Martin Zirkel, Rudolf Bayer
IDEAS
2000
IEEE
96views Database» more  IDEAS 2000»
13 years 10 months ago
A Cost Function for Uniformly Partitioned UB-Trees
Most operations of the relational algebra or SQL - like projection with duplicate elimination, join, ordering, group by and aggregations - are efficiently processed using a sorted...
Volker Markl, Rudolf Bayer