DOCSLIB.ORG

Implementation of the CORAL Deductive Database System

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Implementation of the CORAL Deductive Database System Implementation of the CORAL Deductive Database System Raghu Ramakrishnan Divesh Srivastava Univ of Wisconsin Madison Univ of Wisconsin Madison y Praveen Seshadri S Sudarshan ATT Bell Labs Murray Hill Univ of Wisconsin Madison Intro duction Abstract In this pap er we discuss the design and implementation of CORAL is a deductive database system that provides a mo du the CORAL deductive database system CORAL seeks to lar declarative query languageprogramming language CORAL combine features of a database query language such as e is a deductive system that supp orts a rich declarative language cient treatment of large relations aggregate op erations and provides a wide range of evaluation metho ds and allows a combi declarative semantics with those of a logic programming nation of declarative and imp erative programming The data can language such as more p owerful inference capabiliti es and b e p ersistent on disk or can reside in mainmemory We describ e the architecture and implementation of CORAL supp ort for incomplete and structured data Supp ort for p ersistent relations is provided by interfacing with the EX There were two imp ortant goals in the design of the CORAL ar chitecture to integrate the dierent optimization techniques ODUS storage manager A unique feature of CORAL is in a reasonable fashion and to allow users to inuence the that it provides a wide range of evaluation strategies such as evaluation strategies used so as to exploit the full p ower of the topdown b ottomup and their variants and allows users to CORAL implementation A CORAL declarative program can b e optionally tailor execution of a program through highlevel organized as a collection of interacting mo dules and this mo d annotations The language is describ ed in Applica ule structure is the key to satisfying b oth these goals The high tions in which large amounts of data must b e extensively level mo dule interface allows mo dules with dierent evaluation techniques to interact in a transparent fashion Further users analyzed are likely to b enet from this combination of fea can optionally tailor the execution of a program by selecting from tures In comparison to other deductive database systems among a wide range of control choices at the level of each mo dule such as Aditi EKSV LDL LOLA and CORAL also has an interface with C and users can pro NailGlue CORAL provides a more p owerful language gram in a combination of declarative CORAL and C extended and supp orts a much wider range of optimization techniques with CORAL primitives A high degree of extensibility is provided We highlight several design decisions that allowed us to by allowing C programmers to use the class structure of C to enhance the CORAL implementation integrate often unrelated evaluation techniques and opti mizations in a nearly seamless fashion Sp ecically we con This research was supp orted by a David and Lucile Packard sider the following issues Foundation Fellowship in Science and engineering a Presidential Young Investigator Award with matching grants from Digital Data representation eg constants lists terms Equipment Relation representation and implementation eg in Corp oration Tandem and Xerox and NSF grant IRI mainmemory and diskresident The address of the authors are Computer Sciences De partment University of Wisconsin Madison WI Index structures eg hashstructures and Btrees USA and ATT Bell Lab oratories Mountain Av enue Murray Hill NJ USA The authors email Evaluation techniques eg materialization and top addresses are fraghudiveshpraveengcswiscedu and sudar down sharesearchattcom y The work of this author was p erformed largely while he was In the CORAL implementation we divide evaluation into in the University of Wisconsin Madison a numb er of distinct subtasks and provide a clean inter face b etween the subtasks relevant optimization techniques can b e almost indep endentl y applied to each subtask Ex tending database programming languages has received much attention lately and we b elieve that the CORAL exp eri ence oers guidelines for resolving several common issues 0 that go b eyond the sp ecic extensions that are addressed in Page QUERY DATA CORAL MAIN EVALUATION MANAGER MEMORY SYSTEM One of our goals was to allow users to exploit the full answers p ower of the implementation CORAL supp orts a very rich and we b elieve that some user guidance is criti language query optimized USER program to eectively optimizing many sophisticated programs cal INTERFACE EXODUS is to provide users with the ability to cho ose The problem O.S. STORAGE supp orted by CORAL in a from the suite of optimizations program FILES MANAGER relatively orthogonal and highlevel way and to use a combi QUERY t parts of a program The nation of optimizations for dieren OPTIMIZER module structure was a key to solving this problem The in terface b etween mo dules is kept at a high level evaluation techniques can b e chosen on a p ermo dule basis through op tional annotations and mo dules with dierent evaluation Figure CORAL System Architecture techniques can interact in a nearly transparent fashion An overview of the CORAL declarative language is pre sented in The query language supp orts general Horn ODUS to olkit and thus by CORAL However within each clauses with complex terms setgrouping aggregate op er CORAL pro cess all data that is not managed by the EXO ations negation and data that contains universally quanti DUS storage manager is strictly lo cal to the pro cess Most of ed variables A numb er of user annotations can also b e the eort of design and implementation in CORAL has con sp ecied to guide the system in query evaluation and opti centrated on the singleuser client and the implementation mization The details of the language are b eyond the scop e has fo cused on op eration out of main memory While this of the pap er Many features of the implementation ranging is in keeping with Prologstyle systems there is no part of from lowlevel structures to the interactive system environ the design that is particularly biased towards a mainmemory ment have also b een omitted from the pap er due to shortage 1 system of space The implementation details are found in In Data stored in text les can b e consulted at which p oint Sections we discuss some imp ortant asp ects of the sys the data is converted into mainmemory relations with any tem implementation Section contains an overview of the sp ecied indices indices can also b e created at a later time CORAL system architecture Section explains the under Data stored using the EXODUS storage manager is paged lying representation of the data and Section provides an into EXODUS buers on demand making use of the index overview of query evaluation and optimization Section is ing and scan facilities of the storage manager The design of the main section that deals with implementation issues It the system do es not require that this data b e collected into covers the basic strategies used in evaluating a mo dule as mainmemory CORAL structures b efore b eing used as is well as several imp ortant renements It also addresses user usual in database systems the data can b e accessed purely guidance of query optimization and the interaction in the out of pages in the EXODUS buer p o ol evaluation of dierent mo dules The CORALC inter The query pro cessing system consists of two main parts face and supp ort for extensibility in CORAL including the a query optimizer and a query evaluation system Simple addition of new data typ es and op erations and new rela queries selecting facts from a base relation for instance tion and index implementations are discussed in Sections can b e typ ed in at the user interface and are not opti and We discuss related systems in Section Finally we mized Complex queries are typically dened in declarative provide a retrosp ective discussion of the CORAL design and program mo dules that exp ort predicates views with as outline future research directions in Section so ciated query forms ie sp ecications of what kinds of queries or selections are allowed on the predicate Architecture of the CORAL The query optimizer takes a program mo dule and a query System form as input and generates a rewritten program that is The architecture of the CORAL deductive system is shown optimized for the sp ecied query forms In addition to doing in Figure CORAL is designed primarily as a single user rewriting transformations the optimizer adds several control database system and can b e used in a standalone mo de annotations to those if any sp ecied by the user The Persistent data is stored either in text les or using the rewritten program is stored as a text le which is useful EXODUS storage manager which has a clientserver ar as a debugging aid for the user and is also converted chitecture Each CORAL singleuser pro cess is a client that into an internal representation that is used by the query accesses the common p ersistent data from the server Multi evaluation system ple CORAL pro cesses could interact by accessing p ersistent 1 data stored using the EXODUS storage manager Trans Certain optimizations like structuresharing have however actions and concurrency control are supp orted by the EX b een implemented that optimize mainmemory op eration Page typ es such as integers strings or other abstract datatyp es The query evaluation system takes as input annotated are sub classes of Arg The class Arg denes a set of virtual declarative programs in an internal representation and metho dssuch as equals hash and print
Load more

Recommended publications
  • Advanced Concepts and Applications of the UB-Tree
    INSTITUT FUR¨ INFORMATIK d d d d d d d d DER TECHNISCHEN UNIVERSITAT¨ MUNCHEN¨ d d d d d d d d d d d d Advanced Concepts and Applications of the UB-Tree Robert Josef Widhopf-Fenk Institut f¨urInformatik der Technischen Universit¨atM¨unchen Advanced Concepts and Applications of the UB-Tree Robert Josef Widhopf-Fenk Vollst¨andiger Abdruck der von der Fakult¨at f¨urInformatik der Technischen Universit¨at M¨unchen zur Erlangung des akademischen Grades eines Doktors der Naturwissenschaften genehmigten Dissertation. Vorsitzende: Univ.-Prof. G. J. Klinker, Ph.D. Pr¨uferder Dissertation: 1. Univ.-Prof. R. Bayer, Ph.D., emeritiert 2. Univ.-Prof. A. Kemper, Ph.D. Die Dissertation wurde am 05.08.2004 bei der Technischen Universit¨atM¨unchen eingereicht und durch die Fakult¨at f¨ur Informatik am 07.02.2005 angenommen. Acknowledgements First of all, I want to thank my supervisor Rudolf Bayer for his advice, guidance, support, and patience. Without his invitation to be a Ph.D. student, I would have never been working on database research. I owe my former colleagues in the MISTRAL project many thanks for fruitful discus- sions, proofreading, inspirations, and motivating me: Volker Markl, Frank Ramsak, Martin Zirkel and our “external” member Roland Pieringer. I like to thank my students, Oliver Nickel, Chris Hodges and Werner Unterhofer con- tributing to this work by supporting the implementation of algorithms and performing experiments. Special thanks to our project partners at TransAction, Teijin, GfK, and the members of the EDITH project. And last but not least, many thanks to Michael Bauer, Bernd Reiner, and Charlie Hahn for discussions, distraction and small talk.
    [Show full text]
  • Today's Problems, Yesterday's Toolkit
    TODAY’S PROBLEMS, YESTERDAY’S TOOLKIT Developed by Owned by and working for Australian and New Zealand Governments. 1 THE ROADMAP: TODAY’S PROBLEMS, YESTERDAY’S TOOLKIT 4 THE PUBLIC PROBLEM SOLVING IMPERATIVE 5 The Death of Trust 6 Why Public Problem Solving is So Urgent 7 Why Building Skills will Restore Trust 10 How Public Problems Differ 12 The Public Problem-Solving Pathway 14 INNOVATION SKILLS IN THE PUBLIC SECTOR 16 Definitions of Innovation Skills in the Public Sector 17 The Public Entrepreneur’s Skillset 18 Training for Innovation Skills 21 ANZSOG Survey of Innovation Skills 27 THE INSTITUTIONAL ENVIRONMENT 35 Features of Innovative Institutions 37 New Innovation Institutions 41 Policies to Catalyse Innovative Institutions 46 Talent Mobility: Moving Brains Around 48 Sustaining Innovative Institutions 50 CONCLUSION: LOOKING TO TOMORROW 53 Acknowledgements 56 About the Authors 57 ANNEX I 58 Section I. Respondent’s characteristics 60 Section II. Awareness of skill & training 63 Section III. Use of skill 67 Section IV. Interest in learning skills and learning preferences 71 Section V. Enabling environment 74 Section VI. Relationship between skill practice, training and environment 79 ANNEX II — AUSTRALIA AND NEW ZEALAND INNOVATION SKILLS SURVEY INSTRUMENT 83 ANNEX III — LIST OF INTERVIEWEES 106 All rights reserved. No part of this publication may be reproduced, stored in a retrieval system or transmitted in any form or by any means, electronic, mechanical, photocopying or otherwise, without the prior permission of the publisher. © 2019 The Australia and New Zealand School of Government (ANZSOG) and the authors. 3 THE ROADMAP: TODAY’S PROBLEMS, YESTERDAY’S TOOLKIT Governments of all political stripes are being The report begins by explaining why public problem- buffeted by technological and societal change.
    [Show full text]
  • (12) United States Patent (10) Patent No.: US 8.473450 B2 Bakalash Et Al
    USOO847345OB2 (12) United States Patent (10) Patent No.: US 8.473450 B2 Bakalash et al. (45) Date of Patent: *Jun. 25, 2013 (54) RELATIONAL DATABASE MANAGEMENT (52) U.S. Cl. SYSTEM (RDBMS) EMPLOYING USPC ........................................... 707/600; 707/770 MULTI-DIMENSIONAL DATABASE (MDDB) (58) Field of Classification Search FOR SERVICING QUERY STATEMENTS None THROUGHONE ORMORE CLIENT See application file for complete search history. MACHINES (56) References Cited (75) Inventors: Reuven Bakalash, Beer Sheva (IL); Guy U.S. PATENT DOCUMENTS Shaked, Shdema (IL); Joseph Caspi, 4,590,465. A 5, 1986 Fuchs Herzlyia (IL) 4,598.400 A 7, 1986 Hillis (73) Assignee: Yanicklo Technology Limited Liability (Continued) Company, Wilmington, DE (US) FOREIGN PATENT DOCUMENTS (*) Notice: Subject to any disclaimer, the term of this EP O 314 279 5, 1989 patent is extended or adjusted under 35 EP O 657 052 6, 1995 U.S.C. 154(b) by 13 days. (Continued) OTHER PUBLICATIONS This patent is Subject to a terminal dis claimer. Scheuermann, P. J. Shim and R. Vingralek “WATCHMAN: A Data Warehouse Intelligent Cache Manager'. Proceedings of the 22nd International Conference on Very Large Databases (VLDB), 1996, (21) Appl. No.: 12/455,665 pp. 51-62.* (22) Filed: Jun. 4, 2009 (Continued) (65) Prior Publication Data Primary Examiner — Robert Timblin (74) Attorney, Agent, or Firm — Knobbe, Martens, Olson & US 2009/027641.0 A1 Nov. 5, 2009 Bear LLP Related U.S. Application Data (57) ABSTRACT A relational database management system (RDBMS) for ser (63) Continuation of application No. 1 1/888,904, filed on vicing query statements through one or more client machines.
    [Show full text]
  • Vasili Korol
    Vasili Korol Senior Software Developer Odense, Denmark Age: 35 mob.: +45 20 68 50 23 Married, have son (born 2010) e-mail: [email protected] ​ Personal Statement ⚬ Strong IT skills (16+ years of versatile experience) ⚬ Background in physics research ⚬ Work effectively both as team member and leader ⚬ Enthusiastic and committed ⚬ Spoken languages: Russian (native), English (fluent), Danish (Prøve i Dansk 3 / level B2) ​ ​ ​ ​ Education 2006–2008: Master’s degree (with distinction) in applied physics. ​ 2002–2006: Bachelor’s degree (with distinction) in applied physics. Under- to postgraduate student at St. Petersburg State Polytechnical University, Faculty of Physics and Technology, Dept. of Cosmic Physics. The thesis “Search for possible space-time variations of the fine-structure constant and isotopic shifts” (a supervisor Prof. ​ M.G. Kozlov). ​ 1992-2002: School education in St. Petersburg, Russia and Belfast, UK (in 1993). Professional Career 2015 – Feb 2021: Software developer in the QuantBio research group at the University of ​ ​ ​ ​ Southern Denmark (SDU), Institute of Physics, Chemistry and Pharmacy (HPC section). I am the principal developer of VIKING, a service providing a web interface for configuring ​ ​ ​ and running scientific computational tasks on supercomputers. I designed the software architecture, developed the system core and coordinated the work of several developers. 2014 – 2015: Lead programmer (Perl) at Internet Projects LLC, russian informational portals subscribe.ru and sendsay.ru (St. Petersburg, Russia). ​ ​ ​ Worked with a team of developers on projects targeted at developing an API for news aggregation and content processing services. This involved integration with various online platforms (Facebook, Twitter, Vkontakte, LiveJournal, Google Analytics), web scraping and designing instruments for user publications at the portals and beyond.
    [Show full text]
  • A Location Service for Partial Spatial Replicas Implementing an R-Tree in a Relational Database
    A Location Service for Partial Spatial Replicas Implementing an R-Tree in a Relational Database Yun Tian Department of Computer Science, Eastern Washington University Cheney, WA, USA 99004 Philip J. Rhodes Department of Computer and Information Science, University of Mississippi, University, MS, USA 38677 Abstract As parallel computing has become increasingly common, the need for scalable and efficient ways of storing and locating data has become increas- ingly acute. For years, both grid and cloud computing have distributed data across machines and even clusters at different geographic locations (sites). However not all sites need all of the data in a particular data set, or have the (perhaps specialized) processing capabilities required. These facts chal- lenge the conventional wisdom that we should always move the computation to the data rather than the data to the computation. Sometimes the data actually required is small. In other cases, the site with specialized processing capabilities (such as a GPU equipped cluster) cannot handle the demands placed on it unless a way is found to let that cluster select the data that is actually needed, even if it is not stored locally. Keywords: Globus Toolkit, Replica Location Service, R-tree, Prefetching, Spatial, Replica Email addresses: [email protected] (Yun Tian), [email protected] (Philip J. Rhodes) Preprint submitted to Journal of Parallel and Distributed Computing 1. Introduction Although the problems just described are general, this paper concentrates on the problem of computation with spatial data. Such data is often the product of large computations and simulations, and also natural observations. In any case, spatial data sets present special problems, including not only size but also the mismatch between the n-dimensional nature of the dataset and its representation on disk.
    [Show full text]
  • Integrating the UB-Tree Into a Database System Kernel
    Integrating the UB-Tree into a Database System Kernel Frank Ramsak1, Volker Markl1, Robert Fenk1, Martin Zirkel2, Klaus Elhardt3, Rudolf Bayer1,2 1Bayerisches Forschungszentrum 2Institut für Informatik 3TransAction Software GmbH für Wissensbasierte Systeme TU München Gustav-Heinemann-Ring 109, Orleansstraße 34, Orleansstraße 34, D-81739 München, Germany D- 81667 München, Germany D-81667 München, Germany {frank.ramsak, robert.fenk, volker.markl}@forwiss.de, {zirkel, bayer}@in.tum.de, [email protected] Abstract Multidimensional access methods have shown 1 Introduction high potential for significant performance im- Various research approaches in the past have shown that provements in various application domains. multidimensional access methods (MAMs) have a high However, only few approaches have made their impact on different database application domains like data way into commercial products. In commercial warehousing, data mining, or geographical information database management systems (DBMSs) the B- systems. However, despite the vast research effort MAMs Tree is still the prevalent indexing technique. have not made their way into commercial database Integrating new indexing methods into existing management systems on a broad scale. This is mostly due database kernels is in general a very complex to the fact that the integration of these complex data and costly task. Exceptions exist, as our experi- structures into an existing database kernel is fairly ence of integrating the UB-Tree into TransBase, complicated. Especially concurrency and recovery issues, a commercial DBMS, shows. The UB-Tree is a which are as important as performance issues for very promising multidimensional index, which commercial systems, are major obstacles. For most has shown its superiority over traditional access MAMs new solutions to these problems, e.g., locking for methods in different scenarios, especially in R-Trees [KB95, CM98], have to be developed, as the new OLAP applications.
    [Show full text]
  • Transbase®: a Leading-Edge ROLAP Engine Supporting Multidimensional Indexing and Hierarchy Clustering∇ R
    Transbase®: A leading-edge ROLAP Engine supporting multidimensional Indexing and Hierarchy Clustering∇ R. Pieringer1, K. Elhardt1, F. Ramsak2, V. Markl3, R. Fenk2, R. Bayer2 1 Transaction 2 Bayerisches 3IBM Almaden Software GmbH Forschungszentrum für Research Center, Thomas-Dehler- Wissensbasierte Systeme K55/B1, Str. 18 Boltzmannstr. 3 650 Harry Road, San D-81737 München D-85747 München Jose, CA 95120- {pieringer,elhardt}@ {ramsak,fenk}@forwiss.de, 6099 transaction.de [email protected] [email protected] Abstract: Analysis-oriented database applications, such as data warehousing or customer relationship management, play a crucial role in the database area. In general, the multidimensional data model is used in these applications, realized as star or snow-flake schemata in the relational world. The so-called star queries are the prevalent type of queries on such schemata. All database vendors have extended their products to support star queries efficiently. However, mostly reporting queries benefit from the optimizations, like pre-aggregation, while ad-hoc queries usually lack efficient support. We present the DBMS Transbase® in this paper, which provides a new physical organization of the data based on hierarchical clustering and multidimensional clustering combined with multidimensional indexing. In combination with new query optimizations (e.g., hierarchical pre-grouping) significant performance improvements are achieved. The paper describes how the new technology is implemented in the Transbase® product and how it is made available to the user as transparently as possible. The benefits are illustrated with a real-world data warehousing scenario. 1 Introduction Data warehousing (DW), online analytical processing (OLAP), and customer relationship management (CRM), have become a major market in the database area through the last decade.
    [Show full text]
  • Transbase® System Guide Transbase System Guide Version 8.1
    Transbase® System Guide Transbase System Guide Version 8.1 Publication date 2018-05-14 Copyright © 2018 Transaction Software GmbH ALL RIGHTS RESERVED. While every precaution has been taken in the preparation of this document, the publisher assumes no responsibility for errors or omissions, or for damages resulting from the use of the information contained herein. Table of Contents About This Manual ...................................................................................................... vii 1. The Transbase DBMS ................................................................................................ 1 1.1. Transbase Packages ......................................................................................... 1 1.2. Transbase Platforms ........................................................................................ 1 1.2.1. Service Platforms .................................................................................. 2 1.2.2. Client Platforms ................................................................................... 2 2. Applications and Client Software ................................................................................. 3 2.1. Client Software ............................................................................................... 3 2.1.1. Database Browsers ................................................................................ 3 2.1.2. Programming Interfaces ......................................................................... 3 2.2. Database Connections
    [Show full text]
  • Case Study Transbase CD Customer AZ Direct Adress Data
    CASE STUDY Direct marketing supplier AZ Direct relies on Transbase® and Transaction Software's data- base expertise AZ Direct is one of Europe's leading direct marketing companies. AZ Direct offers innovative products and services relating to addresses, information, and information processing. Over almost four decades, the company has grown from a traditional direct marketing company to a universal information pro- vider for marketing. Many companies and agencies have used the ideas and solutions offered by AZ Direct to initiate a successful dialogue with their cus- tomers. AZ Direct is a subsidiary of arvato AG, the internationally networked media service provider of Bertelsmann AG. Bertelsmann AG has 42,000 employees worldwide. For further information, please visit: www.az-direct.de ConData arvato services is a division of AZ Direct. ConData maintains close relationships with top suppliers throughout the direct marketing value chain. For further information, please visit: www.arvato-condata.de Overview The ConTo application Industry: ConTo is a new concept in direct marketing. For the first time, this application Direct marketing combines one of the strongest and best-known consumer databases in Information service Germany with a powerful tool on one program DVD and two data DVDs. Clients receive a comprehensive and constantly updated database embedded Application: in the user-friendly ConTo program. The ConTo application is provided free of ConTo charge. With ConTo, users can easily work with a number of different feature combinations to assemble selections that are specifically customized for end Product: clients, or to optimize consumer address records by comparing them against Transbase® CD reference records.
    [Show full text]
  • Kiev, Ukraine, September 14-17, 1993)
    DOCUMENT RESUME ED 367 314 IR 016 592 AUTHOR Petrushin, V., Ed.; Dovgiallo, A., Ed. TITLE Computer Technologies in Education. Proceedinga of the International Conference on Computer Technologies in Education (Kiev, Ukraine, September 14-17, 1993). PUB DATE 93 NOTE 217p. PUB TYPE Collected Works Conference Proceedings (021) EDRS PRICE MF01/PC09 Plus Postage. DESCRIPTORS Artificial Intelligence; *Computer Assisted Instruction; Computer Literacy; Computer Simulation; Distance Education; Educational Media; *Educational Technology; Elementary Secondary Education; Foreign Countries; Higher Education; Hypermedia; *Information Technology; Learning Processes; Models; Multimedia Instruction; Programming IDENTIFIERS Intelligent Tutoring Systems; Knowledge Representation; Multimedia Materials; Ukraine; United States ABSTRACT The conference reported in this document provides a meeting place for researchers from around the world, where the emphasis is on new ideas connected to computer technologies in education. This volume contains 140 extended abstracts selected by the program committee and organized into the following categories: (1) educational informational technologies (14 titles);(2) multimedia and hypermedia learning environments (24 titles); (3) distance learning (14 titles);(4) knowledge-based systems in education (23 titles);(3) intelligent tutoring systems and their components (19 titles); (6) student modelling (10 titles); (7) simulation environments and teaching science (15 titles); (8) teaching languages and humanities (7 titles); and
    [Show full text]
  • Transbase® CD
    PRODUCT SHEET Publishing Central Databases Widely with Transbase® CD Transbase® CD is a special variant of the database system Transbase®, desi- gned and optimized for databases directly on CD-ROM or DVD-ROM. The range of use of Transbase® CD offers many advantages for the develop- ment and the operration of applications on CD and DVD. Transbase® CD provides for full SQL functionality (SQL 2003) Transbase® CD permits space saving distribution of database contents on CD/DVD-ROM Transbase® CD runs directly with the compressed database contents, thus minimizing local memory requirements. The integrated encryption and the privilege concepts provide an effective security for sensitive stored data. Transbase® CD offers the possibility to continuously update the data via internet using its update mechanism. Transbase® CD is perfect for applications which distribute central databases widely for autonomous operation. Publication of data on CD/DVD-ROM CD-ROM and DVD-ROM remain widely used for distributing information. These media prove themselves to be an important channel for distribution, even in the age of intensive internet usage. These media guarantee an auto- nomous use of the information in the event that use on-line is restricted or even impossible. This is an important aspect which has particular relevance to product information such as technical handbooks, service information and catalogues Database operation direct on CD/DVD-ROM For a long time SQL was considered too cumbersome and complex for these relatively slow media. Transbase® CD, however, is convincing with its full SQL functionality and impressive speed and performance. Page 1 of 6 PRODUCT SHEET This permits not only simple and clear programming, but also the immediate use of all the more pleasing features of SQL database systems: Automatic net- workability, multi-user support, data security monitored by the system, trans- actions and the powerful descriptive query language SQL.
    [Show full text]
  • Modelo Para a Gestão E Controlo Da Entrega Na Distribuição Logística Da Empresa Transbase
    Projecto Mestrado em Computação Móvel Modelo para a gestão e controlo da entrega na distribuição logística da empresa Transbase Sérgio Duarte Mota Leiria, Setembro de 2011 Projecto Mestrado em Comuptação Móvel Modelo para a gestão e controlo da entrega na distribuição logística da empresa Transbase Sérgio Duarte Mota Projecto de Mestrado realizada sob a orientação do Doutor Rui Rijo, Professor da Escola Superior de Tecnologia e Gestão do Instituto Politécnico de Leiria. Leiria, Setembro de 2011 “Acho que deve existir um mercado mundial para, talvez, cinco computadores.” Autor Thomas Watson, dirigente da IBM, 1943 Agradecimentos O sucesso na realização deste trabalho foi alcançado com o apoio e a colaboração de todos os que se enumeram de seguida. A todos gostaria de exprimir os meus mais sinceros agradecimentos e aqui reconhecer o seu contributo. Aos meus familiares e amigos, em especial à minha mãe que sempre me motivou e incentivou. À Ana Ribeiro que sempre me acompanhou nas diversas noites e fins de semana que passei a trabalhar, dando-me energia para continuar. Ao meu orientador Professor Doutor Rui Pedro Charters Lopes Rijo, pela sua disponibilidade, incentivo e motivação. A todos os colaboradores da Transbase que estiveram envolvidos na elaboração deste trabalho e sempre se encontraram disponíveis para me auxiliarem. O meu muito obrigado a todos. ix Resumo A evolução acentuada das tecnologias de informação e comunicação, que se tem vindo a assistir nas últimas décadas, tem permitido que estas se encontrem implementadas em praticamente todas as áreas de negócio. Assim, é com naturalidade que as tecnologias de informação tenham sido adoptadas na logística empresarial.
    [Show full text]