279 search results - page 37 / 56 » Towards Adaptive Costing of Database Access Methods |
207
Voted
ICDE
1999
IEEE
16 years 4 months ago
1999
IEEE
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...
116
click to vote
BPM
2009
Springer
15 years 10 months ago
2009
Springer
Despite the increasing maturity of contemporary Workflow Management Systems (WfMS), there still exist numerous process-aware application systems with more or less hard-coded proce...
143
Voted
SSDBM
2003
IEEE
15 years 8 months ago
2003
IEEE
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 existin...
179
Voted
DASFAA
2004
IEEE
15 years 7 months ago
2004
IEEE
Relational index structures, as for instance the Relational Interval Tree or the Linear Quadtree, support efficient processing of queries on top of existing object-relational datab...
124
Voted
GVD
2001
15 years 5 months ago
2001
A flexible method to store XML documents in relational or object-relational databases is presented that is based on an adaptable fragmentation. Whereas most known approaches decom...