Sciweavers

7640 search results - page 607 / 1528
» Event Database Processing
Sort
View
SSDBM
2002
IEEE
149views Database» more  SSDBM 2002»
16 years 5 days ago
A Cost Model for Interval Intersection Queries on RI-Trees
The efficient management of interval data represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tree1 ), an effi...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...
215
Voted
SIGMOD
2010
ACM
364views Database» more  SIGMOD 2010»
16 years 3 days ago
Optimizing schema-last tuple-store queries in graphd
Current relational databases require that a database schema exist prior to data entry and require manual optimization for best performance. We describe the query optimization tech...
Scott M. Meyer, Jutta Degener, John Giannandrea, B...
SIGMOD
2000
ACM
141views Database» more  SIGMOD 2000»
15 years 11 months ago
Counting, Enumerating, and Sampling of Execution Plans in a Cost-Based Query Optimizer
Testing an SQL database system by running large sets of deterministic or stochastic SQL statements is common practice in commercial database development. However, code defects oft...
Florian Waas, César A. Galindo-Legaria
HICSS
1994
IEEE
126views Biometrics» more  HICSS 1994»
15 years 11 months ago
Automating Compensation in a Multidatabase
Compensation is the process by which a committed transaction in a database is undone by running the semantic inverse of that transaction on the database. Compensation has been pro...
Marian H. Nodine, Stanley B. Zdonik
SIGMOD
1990
ACM
122views Database» more  SIGMOD 1990»
15 years 11 months ago
Access Support in Object Bases
In this work access support relataons are introduced as a means for optlmizmg query processing m object-oriented database systems The general idea 1s to mamtam redundant separate ...
Alfons Kemper, Guido Moerkotte