Sciweavers

227 search results - page 38 / 46
» Ranking-based processing of SQL queries
Sort
View
DASFAA
2007
IEEE
165views Database» more  DASFAA 2007»
14 years 1 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
SIGMOD
2007
ACM
120views Database» more  SIGMOD 2007»
14 years 10 months ago
Xpath on steroids: exploiting relational engines for xpath performance
A lot of research has been conducted by the database community on methods and techniques for efficient XPath processing, with great success. Despite the progress made, significant...
Haris Georgiadis, Vasilis Vassalos
IDEAS
2008
IEEE
114views Database» more  IDEAS 2008»
14 years 4 months ago
Incremental view-based analysis of stock market data streams
In this paper we show the usefulness and feasibility of applying conventional SQL queries for analyzing a wide spectrum of data streams. As application area we have chosen the ana...
Andreas Behrend, Christian Dorau, Rainer Manthey, ...
CORR
2008
Springer
120views Education» more  CORR 2008»
13 years 10 months ago
XQuery Join Graph Isolation
A purely relational account of the true XQuery semantics can turn any relational database system into an XQuery processor. Compiling nested expressions of the fully compositional X...
Torsten Grust, Manuel Mayr, Jan Rittinger
IDEAS
2000
IEEE
96views Database» more  IDEAS 2000»
14 years 2 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