Sciweavers

10 search results - page 2 / 2
» Optimization of Object-Oriented Queries by Inverse Methods
Sort
View
VLDB
1995
ACM
129views Database» more  VLDB 1995»
13 years 8 months ago
A Cost Model for Clustered Object-Oriented Databases
Query processing is one of the most, critical issues in Object-Oriented DBMSs. Extensible opt,imizers with efficient, search strategies require a cost model to select the most eff...
Georges Gardarin, Jean-Robert Gruser, Zhao-Hui Tan...
STOC
2003
ACM
193views Algorithms» more  STOC 2003»
14 years 5 months ago
Space efficient dynamic stabbing with fast queries
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
Mikkel Thorup
SIGMOD
1996
ACM
120views Database» more  SIGMOD 1996»
13 years 9 months ago
Query Execution Techniques for Caching Expensive Methods
Object-Relational and Object-Oriented DBMSs allow users to invoke time-consuming ("expensive") methods in their queries. When queries containing these expensive methods a...
Joseph M. Hellerstein, Jeffrey F. Naughton
SIGMOD
2010
ACM
364views Database» more  SIGMOD 2010»
13 years 9 months 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...
HICSS
2011
IEEE
157views Biometrics» more  HICSS 2011»
12 years 8 months ago
Reusing Relational Queries for Intuitive Decision Optimization
— Decision optimization is used in many applications such as those for finding the best course of action in emergencies. However, optimization solutions require considerable mat...
Alexander Brodsky, Nathan E. Egge, Xiaoyang Sean W...