Sciweavers

848 search results - page 101 / 170
» Optimization of Sequence Queries in Database Systems
Sort
View
GEOINFO
2003
13 years 10 months ago
Efficient Query Processing on the Relational Quadtree
Relational index structures, as for instance the Relational Interval Tree, the Relational R-Tree, or the Linear Quadtree, support efficient processing of queries on top of existing...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
DBPL
1991
Springer
98views Database» more  DBPL 1991»
14 years 9 days ago
Structural Recursion as a Query Language
We propose a programming paradigm that tries to get close to both the semantic simplicity of relational algebra, and the expressive power of unrestricted programming languages. It...
Val Tannen, Peter Buneman, Shamim A. Naqvi
BTW
2007
Springer
164views Database» more  BTW 2007»
14 years 3 months ago
Integrating Structural Joins into a Tuple-Based XPath Algebra
: Over the recent years, very little effort has been made to give XPath a proper algebraic treatment. The only laudable exception is the Natix Algebra (NAL) which defines the tran...
Christian Mathis
EDBT
2008
ACM
144views Database» more  EDBT 2008»
14 years 9 months ago
BI batch manager: a system for managing batch workloads on enterprise data-warehouses
Modern enterprise data warehouses have complex workloads that are notoriously difficult to manage. An important problem in workload management is to run these complex workloads `o...
Abhay Mehta, Chetan Gupta, Umeshwar Dayal
IDEAS
2003
IEEE
106views Database» more  IDEAS 2003»
14 years 2 months ago
Frequent Itemsets Mining for Database Auto-Administration
With the wide development of databases in general and data warehouses in particular, it is important to reduce the tasks that a database administrator must perform manually. The a...
Kamel Aouiche, Jérôme Darmont, Le Gru...