scholarly journals Incorporating Hypothetical Views and Extended Recursion into SQL Database Systems

10.29007/3drl ◽  
2018 ◽  
Author(s):  
Gabriel Aranda ◽  
Susana Nieva ◽  
Fernando Saenz-Perez ◽  
Jaime Sánchez-Hernández

Current database systems supporting recursive SQL imposerestrictions on queries such as linearity, and do not implement mutualrecursion. In a previous work we presented the language and prototypeR-SQL to overcome those drawbacks. Now we introduce a formalizationand an implementation of the database system HR-SQL that, in addition to extended recursion, incorporates hypothetical reasoning in a novelway which cannot be found in any other SQL system, allowing both positive and negative assumptions. The formalization extends the fixpointsemantics of R-SQL. The implementation improves the eciency of theprevious prototype and is integrated in a commercial DBMS.

2020 ◽  
Vol 271 ◽  
pp. 104485
Author(s):  
Susana Nieva ◽  
Fernando Sáenz-Pérez ◽  
Jaime Sánchez-Hernández

Author(s):  
N. Narikawa ◽  
T. Sato ◽  
N. Sasaki

Abstract This paper gives an overview of an integrated and intelligent database system for a plant engineering framework. We have integrated existing two-dimensional (2D) CAD systems, a three-dimensional (3D) CAD system, and a relational database system which stores engineering information such as design conditions, maintenance histories, and inherent properties. By integrating these systems, the infrastructure for concurrent engineering has been realized. As for design knowledge, we treat object-oriented programming as a useful knowledge representation method. We analyze the plant structure and functional requirements of the system, and then represented them by using the hierarchical Class structure. Design knowledge accompanies the Class, so we represent it using Method. As a design automation system, we develop an automated design check system. This is implemented by using the Common Lisp Object System. These systems are the main parts of the plant engineering framework, and are utilized in the practical design. We intend to develop a mechanical/electronic design framework using the same approach.


Author(s):  
YUN BAI ◽  
YAN ZHANG

In this paper, we propose a formal approach of Artificial Intelligence (AI) in securing object oriented database systems. We combine the specification of object oriented database with security policies and provide its formal syntax and semantics. The properties in the inheritance of authorizations in object oriented database system and reasoning about authorizations on data objects are also investigated in detail.


2013 ◽  
Vol 347-350 ◽  
pp. 2236-2240
Author(s):  
Yan Rong Shi ◽  
Tao Hou

Based on the analysis of the workflow patterns, this paper designs the active state of the workflow, and puts forward the idea of the logical design of the engine driven. It can conveniently define the information model of the workflow based on relational database systems, it can effectively reduce the difficulty on the technical development of the workflow engine and take full advantage of existing relational database system to realize the information system that has the nature of the workflow and reduce the cost of the implementation.


2018 ◽  
Vol 8 ◽  
pp. 263-269
Author(s):  
Grzegorz Dziewit ◽  
Jakub Korczyński ◽  
Maria Skublewska-Paszkowska

Comparison of efficiency is not a trivial phenomenon because of disparities between different database systems. This paper presents a methodology of comparing relational database systems in respect of mean time of execution individual DML queries containing subqueries and conjunction of tables. The presented methodology can be additionally accommodated to studies of efficiency in a range of database system itself (study of queries executed directly in database engine). The described methodology allows to receive statement telling which database system is better in comparison to another in dependency of functionalities fulfilled by external application. In the article the analysis of mean time of execution individual DML queries was performed.Two research hypotheses have been put forward: "Microsoft SQL Server database system needs less time to execute INSERT and UPDATE queries than Oracle database" and "Oracle database system needs less time to execute DML queries with binary data than SQL Server"


2021 ◽  
Vol 5 (OOPSLA) ◽  
pp. 1-30
Author(s):  
Haoran Xu ◽  
Fredrik Kjolstad

Fast compilation is important when compilation occurs at runtime, such as query compilers in modern database systems and WebAssembly virtual machines in modern browsers. We present copy-and-patch, an extremely fast compilation technique that also produces good quality code. It is capable of lowering both high-level languages and low-level bytecode programs to binary code, by stitching together code from a large library of binary implementation variants. We call these binary implementations stencils because they have holes where missing values must be inserted during code generation. We show how to construct a stencil library and describe the copy-and-patch algorithm that generates optimized binary code. We demonstrate two use cases of copy-and-patch: a compiler for a high-level C-like language intended for metaprogramming and a compiler for WebAssembly. Our high-level language compiler has negligible compilation cost: it produces code from an AST in less time than it takes to construct the AST. We have implemented an SQL database query compiler on top of this metaprogramming system and show that on TPC-H database benchmarks, copy-and-patch generates code two orders of magnitude faster than LLVM -O0 and three orders of magnitude faster than higher optimization levels. The generated code runs an order of magnitude faster than interpretation and 14% faster than LLVM -O0. Our WebAssembly compiler generates code 4.9X-6.5X faster than Liftoff, the WebAssembly baseline compiler in Google Chrome. The generated code also outperforms Liftoff's by 39%-63% on the Coremark and PolyBenchC WebAssembly benchmarks.


Author(s):  
Alexander Y. Yap

The planning and development of an enterprise-wide electronic database system for e-business usually calls for the re-engineering of information processes coupled with a push toward data content standardization across the entire organization. In this chapter, the case study involves a multi-national conglomerate that is in the process of integrating and Web-enabling their enterprise database systems. The objective of the system was to help engineers sift through millions of components offered by various suppliers and component manufacturers, where the end-result was to improved the integration and efficiency of the product development, engineering design, e-sourcing, and e-procurement processes. This research is a qualitative action research study on how different organizational, social, political, and technical forces influenced the social construction of an enterprise-wide information system. Understanding the dynamics and power of these socio-technical forces in shaping the development environment and change process of enterprise systems is the focal point of this chapter’s discussion.


Author(s):  
Soon M. Chung ◽  
Murali Mangamuri

Data mining from relations is becoming increasingly important with the advent of parallel database systems. In this paper, we propose a new algorithm for mining association rules from relations. The new algorithm is an enhanced version of the SETM algorithm (Houtsma & Swami 1995), and it reduces the number of candidate itemsets considerably. We implemented and evaluated the new algorithm on a parallel NCR Teradata database system. The new algorithm is much faster than the SETM algorithm, and its performance is quite scalable.


Author(s):  
Amita Goyal Chin

In a distributed database system, an increase in workload typically necessitates the installation of additional database servers followed by the implementation of expensive data reorganization strategies. We present the Partial REALLOCATE and Full REALLOCATE heuristics for efficient data reallocation. Complexity is controlled and cost minimized by allowing only incremental introduction of servers into the distributed database system. Using first simple examples and then, a simulator, our framework for incremental growth and data reallocation in distributed database systems is shown to produce near optimal solutions when compared with exhaustive methods.


Author(s):  
Fuhua Lin

Synchronization is an important aspect of the design and implementation of distributed multimedia database systems. In this chapter, we first examine the models that have been proposed in the literature to specify multimedia and multi-stream synchronization and the methods to implement synchronization mechanisms in distributed multimedia database systems. Their strengths and limitations have been compared, and the issues about time uncertainty and interactivity in multimedia and multi-stream synchronization specification and implementation are discussed. Moreover, we use an example to show how to incorporate a synchronization agent into a distributed multimedia database system. Finally, we discuss the trend of future research and development of this topic.


Sign in / Sign up

Export Citation Format

Share Document