Filters








116 Hits in 4.6 sec

Experiences building the open OODB query optimizer

José A. Blakeley, William J. McKenna, Goetz Graefe
1993 Proceedings of the 1993 ACM SIGMOD international conference on Management of data - SIGMOD '93  
than, the plans generated by other query optimization strategies.  ...  The Open OODB query optimizer was constructed using the Volcano Optimizer Generator, demonstrating that this second-generation optimizer generator enables rapid development of efficient and effective query  ...  In addition to using the conventional sequential scan on collections, the optimizer seems to use only index-based scan and not to consider other efficient execution algorithms for joins or assembly of  ... 
doi:10.1145/170035.170080 dblp:conf/sigmod/BlakeleyMG93 fatcat:id76z3ctmjfabokmy4yijf5hbi

Experiences building the open OODB query optimizer

José A. Blakeley, William J. McKenna, Goetz Graefe
1993 SIGMOD record  
than, the plans generated by other query optimization strategies.  ...  The Open OODB query optimizer was constructed using the Volcano Optimizer Generator, demonstrating that this second-generation optimizer generator enables rapid development of efficient and effective query  ...  In addition to using the conventional sequential scan on collections, the optimizer seems to use only index-based scan and not to consider other efficient execution algorithms for joins or assembly of  ... 
doi:10.1145/170036.170080 fatcat:fidz7fennnhi3izbm5czw33yoy

E-DEVICE: an extensible active knowledge base system with multiple rule type support

N. Bassiliades, I. Vlahavas, A.K. Elmagarmid
2000 IEEE Transactions on Knowledge and Data Engineering  
The resulting system is a flexible, yet efficient, KBS that gives the user the ability to express knowledge in a variety of high-level forms for advanced problem solving in data intensive applications.  ...  E-DEVICE provides the infrastructure for easily extending the system by adding a) new rule types as subtypes of existing ones and b) transparent optimizations to the rule matching network.  ...  However, in [20J the counting algorithm is used only for non-recursive rules while for recursive ones an algorithm similar to [8] is used.  ... 
doi:10.1109/69.877511 fatcat:simlo4bhvrfytlnz5hlgzqaocm

Dynamic Interpolation B-Tree: A New Access Method

P. Dinadayalan, Gnanambigai Dinadayalan
2011 International Journal of Computer Applications  
Dynamic Interpolation B-tree (DIB) is a new indexing technique supporting query processing in Object-Oriented Databases which is effective and efficient for multimedia databases.  ...  In this new technique all the operations are done efficiently.  ...  Efficient execution of queries is achieved by the allocation of suitable access structure and the use if sophisticated query optimizers.  ... 
doi:10.5120/2206-2804 fatcat:fsr6m55lrngxxe6gsjserqre5e

The indispensability of dispensable indexes

E. Bertino, Beng Chin Ooi
1999 IEEE Transactions on Knowledge and Data Engineering  
databases (OODB).  ...  In this paper, we summarize the major considerations in developing new indexes, paying particular attention to progress made in the design of indexes for spatial, temporal databases, and object-oriented  ...  ACKNOWLEDGMENTS We thank the anonymous referees and our colleagues for valuable suggestions and comments.  ... 
doi:10.1109/69.755611 fatcat:2fcy7yair5fe3az3xaj4lgsjl4

Query Optimization for XML

Jason McHugh, Jennifer Widom
1999 Very Large Data Bases Conference  
notions of database statistics, and vastly different query execution strategies for different databases.  ...  This paper describes the query processor of Lore, a DBMS for XML-based data supporting an expressive query language. We focus primarily on Lore's cost-based query optimizer.  ...  Recall the hybrid query execution strategy introduced in Section 4.  ... 
dblp:conf/vldb/McHughW99 fatcat:gcr7pvallbcx3b3s3p6jjwr4vq

From Nested-Loop to Join Queries in OODB

Hennie J. Steenhagen, Peter M. G. Apers, Henk M. Blanken, Rolf A. de By
1994 Very Large Data Bases Conference  
Expressions in the from-clause may be base tables as well as setvalued attributes. In this paper, we propose a general strategy for the optimization of nested OOSQL queries.  ...  As in the relational model, the translation/optimization goal is to move from tuple-to set-oriented query processing.  ...  We will use-the term OOSQL for the various proposals of SQL-like languages for OODB. In this paper, we concentrate on efficient support for ad hoc queries formulated in a declarative query language.  ... 
dblp:conf/vldb/SteenhagenABB94 fatcat:55tsjkbfszdpfnernjwldzny3e

A configurable type hierarchy index for OODB

Thomas A. Mueck, Martin L. Polaschek
1997 The VLDB journal  
With respect to the specific requirements of advanced OODB applications, index data structures for type hierarchies in OODBMS have to provide efficient support for multiattribute queries and have to allow  ...  index optimization for a particular query profile.  ...  We would like to thank the reviewers for their comments and suggestions which led to a considerable improvement of the presentation.  ... 
doi:10.1007/s007780050048 fatcat:cz2lobsowzejdogh5e6btoeb2m

A Vertical Partitioning Algorithm for Distributed Object Oriented Databases

Nishant Gaurav
2015 International Journal of Computer Applications  
The algorithm presented here is an enhancement to the previous work of vertical partitioning algorithms in OODB management systems.  ...  The algorithm takes input as the class to be partitioned into fragments or groups, generates Method Usage Matrix as its first step from the methods and queries provided.  ...  Thus, heuristic approaches are necessary to determine the near optimal partition.  ... 
doi:10.5120/21040-3491 fatcat:s5mweb4qeffp3aklmw64mqrl2q

Signature file hierarchies and signature graphs

Yangjun Chen, Yibin Chen
2004 Proceedings of the 2004 ACM symposium on Applied computing - SAC '04  
In this paper, we propose a new index structure for object-oriented databases.  ...  In addition, the signature files (accordingly, the signature graphs) can be organized into a hierarchy according to the nested structure (called the aggregation hierarchy) of classes in an object-oriented  ...  By this strategy, the optimization is achieved by executing step (4) . In this step, some objects are filtered using the corresponding signatures in the query signature tree.  ... 
doi:10.1145/967900.968050 dblp:conf/sac/ChenC04 fatcat:uucit7czvzgmlmzbinwxz3mhea

An evaluation of vertical class partitioning for query processing in object-oriented databases

Chi-wai Fung, K. Karlapalem, Qing Li
2002 IEEE Transactions on Knowledge and Data Engineering  
In this paper, we develop a comprehensive analytical cost model for processing of queries on vertically partitioned OODB classes.  ...  Vertical partitioning is a design technique for reducing the number of disk accesses to execute a given set of queries by minimizing the number of irrelevant instance variables accessed.  ...  ACKNOWLEDGMENTS This research has been supported, in part, by HKUGC Research Grants Council under grant CityU 733/96E.  ... 
doi:10.1109/tkde.2002.1033777 fatcat:yd6lpuvievdgdez2ide2dfousq

Distributed database systems: where are we now?

M.T. Ozsu, P. Valduriez
1991 Computer  
Distributed database technology is expected to have a significant impact on data processing in the upcoming years.  ...  In this paper, we reflect on the promises of distributed database technology, take stock of where we are, and discuss the issues that remain to be solved.  ...  The research of the first author has been partially supported by the Natural Sciences and Engineering Research Council (NSERC) of Canada under the operating grant OGP-0951.  ... 
doi:10.1109/2.84879 fatcat:y5fmci57j5d35irk6ftktqct3i

Graph Object Oriented Database for Semantic Image Retrieval [chapter]

Eugen Ganea, Marius Brezovan
2010 Lecture Notes in Computer Science  
This paper presents a new method for image retrieval using a graph object oriented database for processing the information extracted from the image through the segmentation process and through the semantic  ...  A graph structure is used in all phases of the image processing: image segmentation, image annotation, image indexing and image retrieval.  ...  After the execution, a native query is obtained in this mode, and we have a list of objects corresponding to the images with semantic content according to the query expression.  ... 
doi:10.1007/978-3-642-15576-5_46 fatcat:qmhn7hdbsjhvpf4we5r7z42zje

Parallel database systems: Open problems and new issues

Patrick Valduriez
1993 Distributed and parallel databases  
Furthermore, it is still an open issue to decide which of the various architectures among sharedmemory, shared-disk, and shared-nothing, is best for database management under various conditions.  ...  Parallel database systems attempt to exploit recent multiprocessor computer architectures in order to build high-performance and high-availability database servers at a much lower price than equivalent  ...  In centralized DBMS, query optimization is performed prior to the execution of the query, hence called static, for two reasons.  ... 
doi:10.1007/bf01264049 fatcat:owb356rtkra5fplbwktkwogdfi

Database research at UT Arlington

Sharma Chakravarthy, Alp Aslandogan, Ramez Elmasri, Leonidas Fegaras, JungHwan Oh
2003 SIGMOD record  
The group views interaction with industry as critical for identifying fundamental problems in the areas of databases and information technology usage and functionality.  ...  This approach provides a viable migration path for new techniques/solutions to be integrated into reallife systems/applications.  ...  We have proposed an effective framework for storing XML data in an object-oriented database and an optimization framework with a solid theoretical basis for translating XML queries into efficient algorithms  ... 
doi:10.1145/640990.641006 fatcat:ml6mv5cwcnfdngomhemhabrxou
« Previous Showing results 1 — 15 out of 116 results