Sciweavers

686 search results - page 34 / 138
» A query simulation system to illustrate database query execu...
Sort
View
BTW
1993
Springer
193views Database» more  BTW 1993»
14 years 2 months ago
Query Optimization in an OODBMS
It is clearly crucial for the success of object-oriented databases to find effiĆ cient implementations that improve on the performance of relational sysĆ tems, rather than being...
Christian Rich, Marc H. Scholl
SIGMOD
2007
ACM
219views Database» more  SIGMOD 2007»
14 years 11 months ago
Efficient exploitation of similar subexpressions for query processing
Complex queries often contain common or similar subexpressions, either within a single query or among multiple queries submitted as a batch. If so, query execution time can be imp...
Jingren Zhou, Johann Christoph Freytag, Per-Å...
ICDE
2012
IEEE
256views Database» more  ICDE 2012»
12 years 1 months ago
Micro-Specialization in DBMSes
Abstract—Relational database management systems are general in the sense that they can handle arbitrary schemas, queries, and modifications; this generality is implemented using...
Rui Zhang, Richard T. Snodgrass, Saumya Debray
SIGMOD
1996
ACM
154views Database» more  SIGMOD 1996»
14 years 2 months ago
METU Interoperable Database System
METU INteroperable Database System (MIND) is a multidatabase system that aims at achieving interoperability among heterogeneous, federated DBMSs. MIND architecture is based on OMG...
Asuman Dogac, Ugur Halici, Ebru Kilic, Gökhan...
FUIN
2006
139views more  FUIN 2006»
13 years 10 months ago
Efficient Parallel Query Processing by Graph Ranking
In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorithm due to M...
Dariusz Dereniowski, Marek Kubale