Sciweavers

716 search results - page 20 / 144
» Optimizing Queries in Extended Relational Databases
Sort
View
VLDB
2001
ACM
157views Database» more  VLDB 2001»
15 years 11 months ago
MiniCon: A scalable algorithm for answering queries using views
The problem of answering queries using views is to find efficient methods of answering a query using a set of previously materialized views over the database, rather than accessing...
Rachel Pottinger, Alon Y. Halevy
PEPM
2009
ACM
15 years 8 months ago
From spreadsheets to relational databases and back
Abstract. This paper presents techniques and tools to transform spreadsheets into relational databases and back. A set of data refinement rules is introduced to map a tabular data...
Jácome Cunha, João Saraiva, Joost Vi...
BTW
2005
Springer
108views Database» more  BTW 2005»
15 years 4 months ago
Integrating the Relational Interval Tree into IBM's DB2 Universal Database Server
: User-defined data types such as intervals require specialized access methods to be efficiently searched and queried. As database implementors cannot provide appropriate index str...
Christoph Brochhaus, Jost Enderle, Achim Schlosser...
IDEAS
2009
IEEE
142views Database» more  IDEAS 2009»
15 years 5 months ago
A magic approach to optimizing incremental relational expressions
This paper is concerned with a transformation-based approach to update propagation in an extended version of Codd’s relational algebra which allows for defining derived relatio...
Andreas Behrend
BTW
2005
Springer
142views Database» more  BTW 2005»
15 years 4 months ago
Self-Extending Peer Data Management
Abstract: Peer data management systems (PDMS) are the natural extension of integrated information systems. Conventionally, a single integrating system manages an integrated schema,...
Ralf Heese, Sven Herschel, Felix Naumann, Armin Ro...