221,897 Hits in 6.7 sec

Implementing a generalized access path structure for a relational database system

Theo Haerder
1978 ACM Transactions on Database Systems  
A new kind of implementation technique for access paths connecting sets of tuples qualified by attribute values is described.  ...  Compared to these structures the generalized access path structure is at least competitive in performing retrieval and update operations, while a considerable storage space saving is gained.  ...  ACKNOWLEDGMENT I would like to thank Rudolf Bayer, Mario Schkolnick, and Irving Traiger for their interest in my work and for helpful discussions of this paper.  ... 
doi:10.1145/320263.320284 fatcat:u5nwz3m7pze6barsjd76oba56a

An access path model for physical database design

R. H. Katz, E. Wong
1980 Proceedings of the 1980 ACM SIGMOD international conference on Management of data - SIGMOD '80  
A system specific mapping is then invoked to implement the access path schema by choosing storage structures supported by the target system.  ...  First, a physical design is specified in terms of general properties of access paths, independent of implementation details.  ... 
doi:10.1145/582251.582254 fatcat:xqdn6jibzzgn7cbfeniyftkkaq

Binary-Relational Storage Structures

R. A. Frost
1982 Computer journal  
Consequently, a structure which can store such binary-relationships is logically sufficient as the storage mechanism for a general purpose database management system.  ...  Surprisingly, however, very few systems have been built which use a binary-relational storage structure. The main reason would appear to be the difficulty of implementing such structures efficiently.  ...  This is because all conceptual access paths are implemented equally efficiently in the binary-relational structure.  ... 
doi:10.1093/comjnl/25.3.358 fatcat:x5svi2224rarrhgv7fsndu33xi

Storing XML Data In a Native Repository

Kamil Toman
2004 Databases, Texts, Specifications, Objects  
It contains a description of the experimental database, SXQ-DB, its basic principles and system internals.  ...  This paper is concerned with storing XML data in a native repository suitable for querying with modern languages such as XPath or XQuery.  ...  There is still nothing like relation algebra for classic relational database systems.  ... 
dblp:conf/dateso/Toman04 fatcat:klu5phvrufe3tlhsbs54qzro5q

Research on File and I/O Systems at the University of California, Berkeley

Alan Jay Smith
1982 IEEE Data Engineering Bulletin  
systems, would best satisfy requirements and expenditure constraints for a speci fied business application (JSU81a]).  ...  In a recently completed study, a new approach to the cost/benefit analysis of DBMSs was proposed as a way to simplify the problem of determining which database management system, out of a number of candidate  ...  In addition, the designer will be able to direct the DBDS in the generation of access paths, e.g., to conform to generic access paths available in a particu lar DBMS.  ... 
dblp:journals/debu/Smith82 fatcat:7tzeha7fq5g6npja26ofl3lhrq

An access path model for physical database design

R. H. Katz, E. Wong
1980 Proceedings of the 1980 ACM SIGMOD international conference on Management of data - SIGMOD '80  
A system specific mapping is then invoked to implement the access path schema in terms of the storage structures available in the target system.4.1 Algebraic Structure for Physical Design For the purposes  ...  Because we wish to generate schemas with maximally supported access paths and because the evaluated For systems without index storage structures, it is possible to have a mapping which is evaluated  ... 
doi:10.1145/582250.582254 dblp:conf/sigmod/KatzW80 fatcat:pxhppewpbzhblm54tqmhuql4xe

Dynamic Interpolation B-Tree: A New Access Method

P. Dinadayalan, Gnanambigai Dinadayalan
2011 International Journal of Computer Applications  
The performance of Object-Oriented Database depends on the access method implemented in the data model.  ...  This is a new access method which supports range queries on Object-Oriented Databases. DIB supports inheritance and aggregation hierarchies. DIB has the structure of Dynamic Interpolation B-tree.  ...  Path index can be used to solve nested predicates against all classes along the path. Access relation [2] is a generation of the join indices for OODBS.  ... 
doi:10.5120/2206-2804 fatcat:fsr6m55lrngxxe6gsjserqre5e

Taking the RDF Model Theory Out for a Spin [chapter]

Ora Lassila
2002 Lecture Notes in Computer Science  
Entailment, as defined by RDF's model-theoretical semantics, is a basic requirement for processing RDF, and represents the kind of "semantic interoperability" that RDF-based systems have been anticipated  ...  In this paper we give some results in our investigation of a practical implementation of the entailment rules, based on the graph-walking query mechanism of the Wilbur RDF toolkit.  ...  Acknowledgements The author would like to thank the following individuals for help in the preparation of this article: Mark Adler, Jos de Roo, Pat Hayes, Marcia Lassila, Deborah McGuinness, Esko Nuutila  ... 
doi:10.1007/3-540-48005-6_24 fatcat:datwhsgqlvfivhpn47oklexbey

Extended Authorization Policy for Graph-Structured Data

Aya Mohamed, Dagmar Auer, Daniel Hofer, Josef Küng
2021 SN Computer Science  
However, specific characteristics of graph-structured data, such as attributes on vertices and edges along a path from a given subject to the resource to be accessed, are not yet considered.  ...  AbstractThe high increase in the use of graph databases also for business- and privacy-critical applications demands for a sophisticated, flexible, fine-grained authorization and access control (AC) approach  ...  Acknowledgements The research reported in this paper has been partly supported by the LIT Secure and Correct Systems Lab funded by the State of Upper Austria.  ... 
doi:10.1007/s42979-021-00684-8 fatcat:sh34hrzl65cztl2jldlqvm23c4

Compiled Plans for In-Memory Path-Counting Queries [chapter]

Brandon Myers, Jeremy Hyrkas, Daniel Halperin, Bill Howe
2015 Lecture Notes in Computer Science  
We find preliminary evidence that a code generation approach simplifies the design of a query engine for graph analysis and improves performance over conventional relational databases.  ...  To evaluate this hypothesis, we are exploring code-generation to produce fast in-memory algorithms and data structures for graph patterns that are inaccessible to conventional relational optimizers.  ...  This simplicity, combined with Grappa's good scalability, makes our code generation an easy and efficient method for relational queries on real-world graphs in a distributed setting.  ... 
doi:10.1007/978-3-319-13960-9_3 fatcat:irr2plv7rrgyba6pehlaqyuqhe

Computer Aided Database Design

Karin Beck, Korbinian Kern, Lore Kern-Bausch, Bernd G. Wenzel
1989 International Conference on Advanced Information Systems Engineering  
For all DBMS-based software systems, a good database design is the key to perfonnance.  ...  The fourth section gives you an impression of the resulting table 1U1d index structures for a relational database. The final one contains an outlook on our plans, coming enhancements and futllre work.  ...  For every candidate key a unique access path should be implemented in order to SUpp0l1 database integrity.  ... 
dblp:conf/caise/BeckKKW89 fatcat:6d7opobfhfddjatafbads6vufa

Extending SGML to accommodate database functions: A methodological overview

Arijit Sengupta, Andrew Dillon
1997 Journal of the American Society for Information Science  
Some of the searches, formally called queries. concepts for a Structured Document Database Management System (SDDBMS) specifically designed for SGML documents are described.  ...  Consequently, documents are modeled in object-oriented databases (Abite-pending on the system and platform, and apply systemboul, Cluet, & Milo, 1993), and object-relational datadependent formatting to  ...  Extending hypertext for learning: tially supported by U.S. Dept. of Education award An investigation of access and guidance tools.  ... 
doi:10.1002/(sici)1097-4571(199707)48:7<629::aid-asi10>;2-q fatcat:edtfibfg55fj5lba3zqpe2gf4a

A history and evaluation of System R

Donald D. Chamberlin, Franco Putzolu, Patricia Griffiths Selinger, Mario Schkolnick, Donald R. Slutz, Irving L. Traiger, Bradford W. Wade, Robert A. Yost, Morton M. Astrahan, Michael W. Blasgen, James N. Gray, W. Frank King (+4 others)
1981 Communications of the ACM  
Direct links, although they were implemented at the RSS level, were not used as an access path for user data by the RDS for a twofold reason.  ...  to the optimizer for access path selection.  ... 
doi:10.1145/358769.358784 fatcat:m4435ac4djhkdhwlydcgskaivm

Interface for Navigation and Database - Querying via WWW

A.L. Heuer, K. Siemonsen, T. Engel, C. Meinel
2020 Zenodo  
We describe the concept and the implementation of a Navigation and Database Interface (NDI) on the World Wide Web.  ...  The multilingual design of the meta information set prepares the system for use in an international environment.  ...  Either the system generates then a new navigation page that is presented to the user, or it executes a query on a database.  ... 
doi:10.5281/zenodo.4136839 fatcat:rkt5mrvs5farxokpo2xrtwr2xi

Dual database strategy and implementation

Chia-hao Chang, Thomas G. Steiner
1987 Computers & industrial engineering  
In expanding from an application-oriented hierarchical database model information system to a system integrated with information-oriented relational database model, IBM offers its IMS/DB2 dual database  ...  Automobile industries themselves are going through such a transition in developing their fourth-generation information systems.  ...  Hence IMS can be utilized mainly for operational transaction processing, while the relational database system or the fourth generation language handles the decision support applications.  ... 
doi:10.1016/0360-8352(87)90083-0 fatcat:rqw2v5zlgfhkbdx3lgqxfkjsle
« Previous Showing results 1 — 15 out of 221,897 results