Path Expression Processing. in Korean Natural Language Query Interface. for Object-Oriented Databases. Jinseok Chae and Sukho Lee
|
|
- Beatrice Sherman
- 5 years ago
- Views:
Transcription
1 Path Expression Processing in Korean Natural Language Query Interface for Object-Oriented Databases Jinseok Chae and Sukho Lee Department of Computer Engineering, Seoul National University, San 56-1, Shinrim-Dong, Kwanak-Ku, Seoul, , Korea fwahr, Abstract A natural language query interface for databases provides the user friendliness in retrieving the desired information by querying in a native natural language. Up to now, many natural language query interfaces for conventional databases have been developed. However, the eld of natural language query interfaces for object-oriented databases which have recently started to emerge as the next-generation databases has become a new research area. This paper describes a processing technique to manipulate natural language representations of path expressions. From the fact that the path expression is one of the key features in the object-oriented data model, a frame-based decomposition method is proposed for ecient processing. 1 Introduction The objective of natural language interfaces is to take inputs in human language and extract from them something which is meaningful to a computer. A natural language query interface to a database system provides end users with a way to formulate queries in a native natural language. This is particularly useful because computer-naive users frequently need to access database systems. INTELLECT[1] from AI corporation is a natural language information system which is commercially available. It makes the computer understand everyday English. It is designed to be a domainindependent system for relational databases. KDA[2] integrates natural language query system with skeleton-based query guiding facility. When a This paper was supported in part by NON DIRECTED RESEARCH FUND, Korea Research Foundation. user works with the KDA natural language query system, the query guiding facility supplies several kinds of skeletons to guide users in performing database retrieval tasks. It generates SQL database queries from English natural language queries. NHI[3] and K-NLQ[4] systems are developed as Korean natural language query interfaces for relational databases. The NHI and K-NLQ accept Korean natural language queries and transform them into QUEL and SQL, respectively. Kim et al.[5] proposes a Korean Natural Language Query System which also transforms Korean queries into SQL. Recently, object-oriented databases (OODB) started to emerge as the next-generation databases which can model the complicated real world. Therefore, the eld of natural language query interfaces for objectoriented databases has become a new research area. For object-oriented databases, KID[6] is proposed. This interface transforms Korean queries into query graphs used in object-oriented data model. There are important dierences between the objectoriented data model and the relational data model. The object-oriented data model includes the objectoriented concepts of encapsulation, inheritance, path expressions, and arbitrary data types; these concepts are not part of the conventional data model. Among these, the path expression is one of the key features of the object-oriented data model used to retrieve the desired data by navigating the class-attribute hierarchy. This paper describes a path expression processing technique used in the Korean Interface for Databases (KID) system. The KID employs a frame-based decomposition method to process the natural language representations of path expressions. In this paper, the KID is upgraded to generate OQL (Object Query Language) proposed in ODMG-93[7] instead of query
2 Korean Natural Language Queries KID Frame Name Parents Frame Natural Language Analyzer Predicate Argument Structures Semantic Interpreter Query Frames OQL Generator OQL Figure 1: System architecture graphs, the format of a query frame is modied and more basic patterns are identied. The remainder of this paper is organized as follows. The overview of KID and the schema of a sample database, basic patterns, and an extended query frame are explained in Section 2. In Section 3, the processing technique of natural language representations of path expressions is described. Section 4 shows experimental results consisting of a number of examples generating OQL from Korean natural language queries. Finally, the conclusion is given in Section 5. 2 Overview of KID 2.1 System Architecture The KID consists of three modules: natural language analyzer, semantic interpreter and OQL generator. The natural language analyzer accepts Korean queries and generates appropriate parsing trees. The semantic interpreter decomposes the parsing results into query phrases by referring to the database dictionaries and builds query frames for each query phrase. Then the OQL generator integrates these query frames and produces OQL. The block structure of the KID is shown in Figure 1. In the gure, rectangles indicate modules and arrows the ow of processing. Natural language analyzer: This module performs morphological analysis[8] and parsing to create the internal representations such as parsing trees from Korean queries. The parsing mechanism uses a variation of the CYK-algorithm[9]. The KID system employs a general natural language analyzer Figure 2: Format of a query frame used in Korean-English machine translation[10]. The natural language analyzer generates two structures: tree structure and predicate argument structure[11]. Among these, the semantic interpreter accepts the predicate argument structure. Semantic interpreter: This module decomposes the predicate argument structures into query phrases (QPs) and builds query frames (s). It utilizes two database dictionaries: schema dictionary and domain dictionary [6]. The schema dictionary is used to specify the schema related information and the domain dictionary is used to determine the domain of unknown terms having the semantic ambiguities. OQL generator: This module integrates all query frames and generates OQL. A query frame is designed to have the information about the class-attribute hierarchy such as classes, attributes, relationships, values, and operators. The format of a query frame is shown in Figure 2. Comparing to the format in [6], and slots are added. is used to specify the indicated class (or one of its subclasses) to go down the class-attribute hierarchy. is used to apply the aggregation function to the corresponding attribute. 2.2 Class-Attribute Hierarchy Figure 3 shows a sample class-attribute hierarchy used in this paper. It consists of six classes and `' indicates multi-valued attributes. In this classattribute hierarchy, classes have attributes of the reference attribute representing the attribute-domain relationship. 2.3 Basic Patterns A Korean queries can be decomposed into a number of QPs and each QP is one of the identied basic pat-
3 dept snum Integer height Integer residence enrolls* Department univ location String Address zipcode Integer country String city String teacher credit Integer University city president String String Professor major String The Korean words corresponding each head type are as follows. HT1 : _f*"(show),, CK!""(retrieve), )-!" "(output), "-!""(list), HT2 : uvsv' "(who), z. ' "(what),, "' "(how), )$' "(where),. :L' "(when), HT3 : - ( )' ", 2@' ",. ' "(what number of), HT4 : $ "(is there),, "(is not there), 2.4 Denition of Korean Queries Figure 3: Class-attribute hierarchy terns. By analyzing sample queries, we identify seven basic patterns: head phrase I (HP1), head phrase II (HP2), noun modier phrase (NMP), verb modier phrase (VMP), adverb modier phrase (AMP), verb phrase (VP), and comparative phrase (CP). Among these, NMP, VP and CP were identied in previously [6] and other phrases are identied additionally in this paper. The predicate argument structures of each basic pattern are as follows: HP1: HEAD! [ HT1 HT2 HT4 ] ` [SUB OBJ]! NOUN Noun HP2: HEAD! HT3 ` (MOD! ADV ^fx) ` MOD! NOUN - NMP: QP-HEAD! Qp-head ` MOD! NOUN Noun VMP: QP-HEAD! Qp-head ` MOD! VERB Verb AMP: QP-HEAD! Qp-head VP: CP: ` MOD! ADV Adverb QP-HEAD! Qp-head ` [MOD VCON]! VERB Verb ` [MOD OBJ SUB NCON]! NOUN Noun QP-HEAD! Qp-head ` [MOD VCON]! VERB Verb ` SUB! NOUN Noun1 ` MOD! NOUN Noun2 HEAD represents a head word of a sentence. It is classied into four types: HT1, HT2, HT3 and HT4. QP-HEAD indicates a head word of a QP. MOD denotes modiers, SUB subject, OBJ object, VCON verb conjunction, NCON noun conjunction and ADV adverb. The sign ` ' denotes `OR'. A Korean query (KQ) consists of a head phrase (HP) and a main query (MQ). The MQ is classied into two kinds: simple query (SQ) and composite query (CQ). The SQ is a query which is a simple concatenation of several QPs without any conjunction (e.g., `and', `or' or `among'), but the CQ has such conjunctions. If a query has the word ` ' or `" HL' which means `among' in English, then it will have an `AMONG' indicator. The denition of Korean queries is as follows: KQ :: HP M Q M Q :: SQ j CQ SQ :: QP 1 QP 2 QP n (n 1) CQ :: SQ 1 SQ 2 SQ m (m 2) HP :: HP 1 j HP 2 QP :: N M P j V M P j AM P j V P j CP :: AN D j OR j AM ON G 3 Path Expression Processing A path query has been well developed by database researchers during past decade. A path query is a query written against nested data, by specifying search conditions against nested data. A path query contains, instead of just an attribute, a sequence of attribute s called a path expression. For example, a type may have an attribute d `dept'; the domain of `dept' may be a Department type; and the Department type may have an attribute d `'. Then it should be possible to issue a single saying query that \nd all students whose departments d `Computer Eng.'." The WHERE clause of the query may contain a predicate.dept. `Computer Eng.'. Formally, a path expression is of the form
4 sel:attrex 1 : :AttrEx m where sel is the target class and AttrEx i (1 i m) are the reference attributes. The above path expression can be decomposed into sub-path expressions which indicate the reference relationship. The decomposed sub-path expressions are shown below. sel:attrex 1 (toclass 2 ) Class 2 :AttrEx 2 (toclass 3 ) Class m?1:attrex m?1(toclass m ) Therefore, the semantic interpreter can decompose the natural language representations of path expressions into QPs of sub-path expressions. For example, a path expression :dept:univ can be decomposed into QP 1 and QP 2. :dept QP 1 Department:univ QP 2 4 Experiments Q1 is an example of transformation process from Korean queries to OQL. Q1: $" 165_f" V[UW \ $ " UX{" "io$ \HL$"7L $ah"!~! CK, CK!"". (Retrieve students who are taller than 165 and enroll in \Database" which professor \G. D. Hong" teaches.) Predicate argument structure: HEAD! VERB retrieve ` OBJ! NOUN students ` MOD! VERB be taller ` SUB! NOUN height ` MOD! NOUN than 165 ` VCON! VERB and enroll ` MOD! VERB teach ` MOD! NOUN professor ` MOD! NOUN \G. D. Hong" QP QP QP3 QP 2 4 Figure 4: Decomposition process Decomposition process: The decomposition process employs the DFS (Depth First Search) algorithm. Figure 4 explains the process when QP 1 is CP, QP 2 and QP 3 are VP, and QP 4 is NMP. The nodes of the tree structure in Figure 4 denote words in the questions and the numbers above the nodes the visiting sequences by DFS. Decomposed QPs: QP 1 (CP): QP-HEAD! NOUN students ` MOD! VERB be taller ` SUB! NOUN height ` MOD! NOUN than 165 QP 2 (VP): QP-HEAD! NOUN students ` VCON! VERB and enroll QP 3 (VP): QP-HEAD! NOUN \Database" ` MOD! VERB teach ` MOD! NOUN professor QP 4 (NMP): QP-HEAD! NOUN professor ` MOD! NOUN \G. D. Hong" Query frames: Figure 5 shows the query frames for Q1. Three classes are involved in Q1 and these classes are linearly connected by attribute-domain link; i.e., Professor class is referred by class and class is referred by class. OQL: select x from x in, y in x.enrolls where x.height > 165 and y. \Database" and y.teacher. \G. D. Hong" Q2 shows another example in which three classes are involved in a dierent way from Q1; i.e., Department class is referred by class and class is also referred by class. Q2: \, ')! "9L af $UW \HL$"7L$ah"!~! CK, CK!"". (Retrieve students who belong to \Computer Eng." and enrolls in \Database".)
5 height 165 > enrolls Department dept Department "Computer Eng." Professor teacher "Database" Professor "G. D. Hong" enrolls "Database" Figure 5: Query frames for Q1 Figure 6: Query frames for Q2 Predicate argument structure: HEAD! VERB retrieve ` OBJ! NOUN students ` MOD! VERB enrolls ` VCON! VERB and belong to ` MOD! NOUN \Computer Eng." Decomposed QPs: QP 1 (VP): Q P-HEAD! NOUN students ` M OD! VERB enrolls QP 2 (VP): QP-HEAD! NOUN students ` VCON! VERB and belong to ` MOD! NOUN \Computer Eng." Query frames: Figure 6 shows the query frames for Q2. OQL: select x from x in, y in x.enrolls where x.dept. \Computer Eng." and y. \Database" Q3 shows an example in which only one class is involved. Q3: \ $ " UX{. z. ' "? (What does professor \G. D. Hong" major in?) OQL: select x.major from x in Professor where x. \G. D. Hong" The execution results of experiments show that about 70% of sample questions are interpreted correctly if sample questions are generated by persons who have knowledge about databases and schema information. 5 Conclusion In this paper, we present a path expression processing technique to transform Korean natural language queries into OQL. From the fact that path expression processing is one of the important issues in object-oriented query processing, we propose a frame-based decomposition approach in order to manipulate the natural language representations of path expressions. Since a path expression can be decomposed into sub-path expressions, Korean queries can be decomposed into query phrases. The decomposed query phrases are transformed into query frames. Finally, all query frames are integrated and OQL is generated. It is necessary to collect a lot of sample queries for improving the performance of a natural language interface. In the future, we will concentrate on upgrading the processing capability of the system by collecting and experimenting a large number of sample queries.
6 A prototype system of KID is implemented on a SUN sparcstation using the C language. References [1] L. R. Harris, \Experience with INTELLECT: Articial intelligence technology transfer," The AI Magazine, Vol. 5, No. 2, 1984, pp [2] X. Wu, and T. Ichikawa, \KDA: A Knowledge- Based Database Assistant with a Query Guiding Facility," Trans. on Knowledge and Data Engineering, Vol. 4, No. 5, 1992, pp [3] S. Kim, \The Design and Implementation of Interface for Processing Natural Hangul Query," (in Korean) Journal of the Korean Information Science Society, Vol. 12, No. 1, 1985, pp [4] J. Chae, S. Kim, and S. Lee, \Design and Implementation of a Natural Language DB Query System," (in Korean) Journal of the Korean Information Science Society, Vol. 20, No. 6, 1993, pp [5] J. M. Kim, M, Y. Hyun, and S. J. Lee, \Koran Natural Language Query System for Searching Database,"(in Korean) Proc. of the 21st KISS Fall Conference, Oct., 1994, pp [6] J. Chae, and S. Lee, \Natural Language Query Processing in Korean Interface for Object- Oriented Databases," Proc. of the First International Workshop on Applications of Natural Language to Data Bases, June, [7] R. G. G. Cattell, (1993). The Object Database Standard: ODMG-93, Morgan Kaufmann Publishers. [8] S. S. Kang, and Y. T. Kim, \Syllable-based Model for the Korean Morphology," Proc. of the COLING 94, 1994, pp [9] J. Yang, and Y. T. Kim, \Korean Analysis using Multiple Knowledge Sources," (in Korean) Journal of the Korean Information Science Society, Vol. 21, No. 7, 1994, pp [10] H. G. Lee, and Y. T. Kim, \Korean-English Machine Translation based on Idiom Recognition," Proc. of IEEE Region 10 Conference (TENCON '93), [11] J. Allen, Natural Language Understanding, Benjamin/Cummings Co. Ltd., 1988.
0. Database Systems 1.1 Introduction to DBMS Information is one of the most valuable resources in this information age! How do we effectively and efficiently manage this information? - How does Wal-Mart
More informationDesign and Implementation of HTML5 based SVM for Integrating Runtime of Smart Devices and Web Environments
Vol.8, No.3 (2014), pp.223-234 http://dx.doi.org/10.14257/ijsh.2014.8.3.21 Design and Implementation of HTML5 based SVM for Integrating Runtime of Smart Devices and Web Environments Yunsik Son 1, Seman
More informationDevelopment of AniDB and AniXML Schema for Semi-Autonomous Animation Contents Generation using Korean Fairy Tale Text
Development of AniDB and AniXML Schema for Semi-Autonomous Animation Contents Generation using Korean Fairy Tale Text Young-One Cho, Byung-Chul So and + Jin-Woo Jung, Department of Computer Engineering,
More informationCS 4604: Introduction to Database Management Systems. B. Aditya Prakash Lecture #5: Entity/Relational Models---Part 1
CS 4604: Introduction to Database Management Systems B. Aditya Prakash Lecture #5: Entity/Relational Models---Part 1 E/R: NOT IN BOOK! IMPORTANT: Follow only lecture slides for this topic! Differences
More informationV. Thulasinath M.Tech, CSE Department, JNTU College of Engineering Anantapur, Andhra Pradesh, India
International Journal of Scientific Research in Computer Science, Engineering and Information Technology 2017 IJSRCSEIT Volume 2 Issue 5 ISSN : 2456-3307 Natural Language Interface to Database Using Modified
More informationAn Optimization of Disjunctive Queries : Union-Pushdown *
An Optimization of Disjunctive Queries : Union-Pushdown * Jae-young hang Sang-goo Lee Department of omputer Science Seoul National University Shilim-dong, San 56-1, Seoul, Korea 151-742 {jychang, sglee}@mercury.snu.ac.kr
More informationData integration supports seamless access to autonomous, heterogeneous information
Using Constraints to Describe Source Contents in Data Integration Systems Chen Li, University of California, Irvine Data integration supports seamless access to autonomous, heterogeneous information sources
More informationA NATUWAL LANGUAGE INTERFACE USING A WORLD MODEL
A NATUWAL LANGUAGE INTERFACE USING A WORLD MODEL Yoshio Izumida, Hiroshi Ishikawa, Toshiaki Yoshino, Tadashi Hoshiai, and Akifumi Makinouchi Software Laboratory Fujitsu Laboratories Ltd. 1015 kamikodanaka,
More informationCHAPTER 5 SEARCH ENGINE USING SEMANTIC CONCEPTS
82 CHAPTER 5 SEARCH ENGINE USING SEMANTIC CONCEPTS In recent years, everybody is in thirst of getting information from the internet. Search engines are used to fulfill the need of them. Even though the
More informationADVANCED DATABASES ; Spring 2015 Prof. Sang-goo Lee (11:00pm: Mon & Wed: Room ) Advanced DB Copyright by S.-g.
4541.564; Spring 2015 Prof. Sang-goo Lee (11:00pm: Mon & Wed: Room 301-203) ADVANCED DATABASES Copyright by S.-g. Lee Review - 1 General Info. Text Book Database System Concepts, 6 th Ed., Silberschatz,
More informationCopyright 2016 Ramez Elmasri and Shamkant B. Navathe
Chapter 12 Outline Overview of Object Database Concepts Object-Relational Features Object Database Extensions to SQL ODMG Object Model and the Object Definition Language ODL Object Database Conceptual
More informationHigh Level Database Models
ICS 321 Fall 2011 High Level Database Models Asst. Prof. Lipyeow Lim Information & Computer Science Department University of Hawaii at Manoa 9/21/2011 Lipyeow Lim -- University of Hawaii at Manoa 1 Database
More informationConceptual Database Design. COSC 304 Introduction to Database Systems. Entity-Relationship Modeling. Entity-Relationship Modeling
COSC 304 Introduction to Database Systems Entity-Relationship Modeling Dr. Ramon Lawrence University of British Columbia Okanagan ramon.lawrence@ubc.ca Conceptual Database Design Conceptual database design
More informationJava OOP: Java Documentation
OpenStax-CNX module: m45117 1 Java OOP: Java Documentation R.G. (Dick) Baldwin This work is produced by OpenStax-CNX and licensed under the Creative Commons Attribution License 3.0 Abstract Learn to use
More informationMIS Database Systems Entity-Relationship Model.
MIS 335 - Database Systems Entity-Relationship Model http://www.mis.boun.edu.tr/durahim/ Ahmet Onur Durahim Learning Objectives Database Design Main concepts in the ER model? ER Diagrams Database Design
More informationCOSC 304 Introduction to Database Systems. Entity-Relationship Modeling
COSC 304 Introduction to Database Systems Entity-Relationship Modeling Dr. Ramon Lawrence University of British Columbia Okanagan ramon.lawrence@ubc.ca Conceptual Database Design Conceptual database design
More informationA Transaction Processing Technique in Real-Time Object- Oriented Databases
122 IJCSNS International Journal of Computer Science and Network Security, VOL.8 No.1, January 2008 A Transaction Processing Technique in Real-Time Object- Oriented Databases Woochun Jun Dept. of Computer
More informationIntroduction to Scheme
How do you describe them Introduction to Scheme Gul Agha CS 421 Fall 2006 A language is described by specifying its syntax and semantics Syntax: The rules for writing programs. We will use Context Free
More informationE-R Model. Hi! Here in this lecture we are going to discuss about the E-R Model.
E-R Model Hi! Here in this lecture we are going to discuss about the E-R Model. What is Entity-Relationship Model? The entity-relationship model is useful because, as we will soon see, it facilitates communication
More informationIntroduction to OOP. Procedural Programming sequence of statements to solve a problem.
Introduction to OOP C++ - hybrid language improved and extended standard C (procedural language) by adding constructs and syntax for use as an object oriented language. Object-Oriented and Procedural Programming
More informationSuper-Key Classes for Updating. Materialized Derived Classes in Object Bases
Super-Key Classes for Updating Materialized Derived Classes in Object Bases Shin'ichi KONOMI 1, Tetsuya FURUKAWA 1 and Yahiko KAMBAYASHI 2 1 Comper Center, Kyushu University, Higashi, Fukuoka 812, Japan
More informationWeb Information Retrieval using WordNet
Web Information Retrieval using WordNet Jyotsna Gharat Asst. Professor, Xavier Institute of Engineering, Mumbai, India Jayant Gadge Asst. Professor, Thadomal Shahani Engineering College Mumbai, India ABSTRACT
More informationSAMOS: an Active Object{Oriented Database System. Stella Gatziu, Klaus R. Dittrich. Database Technology Research Group
SAMOS: an Active Object{Oriented Database System Stella Gatziu, Klaus R. Dittrich Database Technology Research Group Institut fur Informatik, Universitat Zurich fgatziu, dittrichg@ifi.unizh.ch to appear
More informationThe Architecture of a System for the Indexing of Images by. Content
The Architecture of a System for the Indexing of s by Content S. Kostomanolakis, M. Lourakis, C. Chronaki, Y. Kavaklis, and S. C. Orphanoudakis Computer Vision and Robotics Laboratory Institute of Computer
More informationIllumination-Robust Face Recognition based on Gabor Feature Face Intrinsic Identity PCA Model
Illumination-Robust Face Recognition based on Gabor Feature Face Intrinsic Identity PCA Model TAE IN SEOL*, SUN-TAE CHUNG*, SUNHO KI**, SEONGWON CHO**, YUN-KWANG HONG*** *School of Electronic Engineering
More informationSQL-to-MapReduce Translation for Efficient OLAP Query Processing
, pp.61-70 http://dx.doi.org/10.14257/ijdta.2017.10.6.05 SQL-to-MapReduce Translation for Efficient OLAP Query Processing with MapReduce Hyeon Gyu Kim Department of Computer Engineering, Sahmyook University,
More informationKnowledge Representations. How else can we represent knowledge in addition to formal logic?
Knowledge Representations How else can we represent knowledge in addition to formal logic? 1 Common Knowledge Representations Formal Logic Production Rules Semantic Nets Schemata and Frames 2 Production
More informationCS143: Relational Model
CS143: Relational Model Book Chapters (4th) Chapters 1.3-5, 3.1, 4.11 (5th) Chapters 1.3-7, 2.1, 3.1-2, 4.1 (6th) Chapters 1.3-6, 2.105, 3.1-2, 4.5 Things to Learn Data model Relational model Database
More informationChapter 11 Object and Object- Relational Databases
Chapter 11 Object and Object- Relational Databases Copyright 2011 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Chapter 11 Outline Overview of Object Database Concepts Object-Relational
More informationConceptual Design with ER Model
Conceptual Design with ER Model Lecture #2 1/24/2012 Jeff Ballard CS564, Spring 2014, Database Management Systems 1 See the Moodle page Due February 7 Groups of 2-3 people Pick a team name Homework 1 is
More informationFuzzy Structured Query Language (FSQL) for Relational Database Systems 관계형데이터베이스시스템을위한퍼지질의어 (FSQL)
한국산학기술학회논문지 Vol. 6, No. 3, pp. 265-269, 2005 Fuzzy Structured Query Language (FSQL) for Relational Database Systems 관계형데이터베이스시스템을위한퍼지질의어 (FSQL) 정은영1 박순철2 이상범3* 요약본논문에서는관계형데이터베이스에서운영될수있는퍼지질의어인 FSQL 를소개하였다.
More informationOntology Based Application Server to Execute Semantic Rich Requests
Ontology Based Application Server to Execute Semantic Rich Requests Flávia Linhalis and Dilvan de Abreu Moreira University of São Paulo - Brazil Introduction Application Servers Provide functionalities
More informationEntity Relationship Data Model. Slides by: Shree Jaswal
Entity Relationship Data Model Slides by: Shree Jaswal Topics: Conceptual Modeling of a database, The Entity-Relationship (ER) Model, Entity Types, Entity Sets, Attributes, and Keys, Relationship Types,
More information(a) Turing test: a test designed to indicate whether or not a system can be said to be intelligent. If a computer
CS188 Intro to AI Spring 1993 Stuart Russell Final solutions 1. (12 pts.) Denitions Provide brief, precise denitions of the following: (a) Turing test: a test designed to indicate whether or not a system
More information1st frame Figure 1: Ball Trajectory, shadow trajectory and a reference player 48th frame the points S and E is a straight line and the plane formed by
Physics-based 3D Position Analysis of a Soccer Ball from Monocular Image Sequences Taeone Kim, Yongduek Seo, Ki-Sang Hong Dept. of EE, POSTECH San 31 Hyoja Dong, Pohang, 790-784, Republic of Korea Abstract
More informationOntological Modeling: Part 2
Ontological Modeling: Part 2 Terry Halpin LogicBlox This is the second in a series of articles on ontology-based approaches to modeling. The main focus is on popular ontology languages proposed for the
More informationEECS 647: Introduction to Database Systems
EECS 647: Introduction to Database Systems Instructor: Luke Huan Spring 2009 Stating Points A database A database management system A miniworld A data model Conceptual model Relational model 2/24/2009
More informationUMIACS-TR December, CS-TR-3192 Revised April, William Pugh. Dept. of Computer Science. Univ. of Maryland, College Park, MD 20742
UMIACS-TR-93-133 December, 1992 CS-TR-3192 Revised April, 1993 Denitions of Dependence Distance William Pugh Institute for Advanced Computer Studies Dept. of Computer Science Univ. of Maryland, College
More informationCHAPTER 2 LITERATURE REVIEW
CHAPTER 2 LITERATURE REVIEW 2.0 OVERVIEW This literature review is initially done on OOP, RDBMS, OODBMS and ORDBMS in terms of their basic concept and capability. Later on, their inter-relationship, pros
More informationPrinciples of Programming Languages COMP251: Syntax and Grammars
Principles of Programming Languages COMP251: Syntax and Grammars Prof. Dekai Wu Department of Computer Science and Engineering The Hong Kong University of Science and Technology Hong Kong, China Fall 2006
More informationAn UML-XML-RDB Model Mapping Solution for Facilitating Information Standardization and Sharing in Construction Industry
An UML-XML-RDB Model Mapping Solution for Facilitating Information Standardization and Sharing in Construction Industry I-Chen Wu 1 and Shang-Hsien Hsieh 2 Department of Civil Engineering, National Taiwan
More informationDatabase Management
Database Management - 2011 Model Answers 1. a. A data model should comprise a structural part, an integrity part and a manipulative part. The relational model provides standard definitions for all three
More informationCS 582 Database Management Systems II
Review of SQL Basics SQL overview Several parts Data-definition language (DDL): insert, delete, modify schemas Data-manipulation language (DML): insert, delete, modify tuples Integrity View definition
More informationA CORBA-based Multidatabase System - Panorama Project
A CORBA-based Multidatabase System - Panorama Project Lou Qin-jian, Sarem Mudar, Li Rui-xuan, Xiao Wei-jun, Lu Zheng-ding, Chen Chuan-bo School of Computer Science and Technology, Huazhong University of
More informationThis is the Pre-Published Version
This is the Pre-Published Version Path Dictionary: A New Approach to Query Processing in Object-Oriented Databases Wang-chien Lee Dept of Computer and Information Science The Ohio State University Columbus,
More informationKnowledge Representation
Knowledge Representation What is knowledge? Is knowledge the same thing as facts? some define knowledge as the fact or condition of knowing something with familiarity gained through experience or association.
More informationNews-Oriented Keyword Indexing with Maximum Entropy Principle.
News-Oriented Keyword Indexing with Maximum Entropy Principle. Li Sujian' Wang Houfeng' Yu Shiwen' Xin Chengsheng2 'Institute of Computational Linguistics, Peking University, 100871, Beijing, China Ilisujian,
More informationOptimized Query Plan Algorithm for the Nested Query
Optimized Query Plan Algorithm for the Nested Query Chittaranjan Pradhan School of Computer Engineering, KIIT University, Bhubaneswar, India Sushree Sangita Jena School of Computer Engineering, KIIT University,
More informationperspective, logic programs do have a notion of control ow, and the in terms of the central control ow the program embodies.
Projections of Logic Programs Using Symbol Mappings Ashish Jain Department of Computer Engineering and Science Case Western Reserve University Cleveland, OH 44106 USA email: jain@ces.cwru.edu Abstract
More informationSemantic Image Retrieval Based on Ontology and SPARQL Query
Semantic Image Retrieval Based on Ontology and SPARQL Query N. Magesh Assistant Professor, Dept of Computer Science and Engineering, Institute of Road and Transport Technology, Erode-638 316. Dr. P. Thangaraj
More informationPRG PROGRAMMING ESSENTIALS. Lecture 2 Program flow, Conditionals, Loops
PRG PROGRAMMING ESSENTIALS 1 Lecture 2 Program flow, Conditionals, Loops https://cw.fel.cvut.cz/wiki/courses/be5b33prg/start Michal Reinštein Czech Technical University in Prague, Faculty of Electrical
More informationAggregation Query Model for OODBMS
Aggregation Query Model for OODBMS J. Wenny Rahayu Department of Computer Science and Computer Engineering La Trobe University, Bundoora, Victoria 3083, Australia wenny@cs.latrobe.edu.au David Taniar School
More informationXML Schema Language Specifications for Conditional Knowledge
XML Schema Language Specifications for Conditional Knowledge Nicolae łăndăreanu, Mihaela Colhon, and Cristina Zamfir Abstract The Knowledge Representation and Reasoning (KR&R) is based on the idea that
More informationThe SQL data-definition language (DDL) allows defining :
Introduction to SQL Introduction to SQL Overview of the SQL Query Language Data Definition Basic Query Structure Additional Basic Operations Set Operations Null Values Aggregate Functions Nested Subqueries
More informationClustering Technique with Potter stemmer and Hypergraph Algorithms for Multi-featured Query Processing
Vol.2, Issue.3, May-June 2012 pp-960-965 ISSN: 2249-6645 Clustering Technique with Potter stemmer and Hypergraph Algorithms for Multi-featured Query Processing Abstract In navigational system, it is important
More informationDatabase System Concepts and Architecture
1 / 14 Data Models and Their Categories History of Data Models Schemas, Instances, and States Three-Schema Architecture Data Independence DBMS Languages and Interfaces Database System Utilities and Tools
More informationAn Optimal Locking Scheme in Object-Oriented Database Systems
An Optimal Locking Scheme in Object-Oriented Database Systems Woochun Jun Le Gruenwald Dept. of Computer Education School of Computer Science Seoul National Univ. of Education Univ. of Oklahoma Seoul,
More informationX-KIF New Knowledge Modeling Language
Proceedings of I-MEDIA 07 and I-SEMANTICS 07 Graz, Austria, September 5-7, 2007 X-KIF New Knowledge Modeling Language Michal Ševčenko (Czech Technical University in Prague sevcenko@vc.cvut.cz) Abstract:
More informationAdding Context to Concept Trees
Adding Context to Concept Trees Kieran Greer, Distributed Computing Systems, Belfast, UK. http://distributedcomputingsystems.co.uk Version 1.2 Abstract Concept Trees are a type of database that can organise
More informationdetected inference channel is eliminated by redesigning the database schema [Lunt, 1989] or upgrading the paths that lead to the inference [Stickel, 1
THE DESIGN AND IMPLEMENTATION OF A DATA LEVEL DATABASE INFERENCE DETECTION SYSTEM Raymond W. Yip and Karl N. Levitt Abstract: Inference is a way tosubvert access control mechanisms of database systems.
More informationActivity Report at SYSTRAN S.A.
Activity Report at SYSTRAN S.A. Pierre Senellart September 2003 September 2004 1 Introduction I present here work I have done as a software engineer with SYSTRAN. SYSTRAN is a leading company in machine
More informationENTITY-RELATIONSHIP MODEL. CS 564- Spring 2018
ENTITY-RELATIONSHIP MODEL CS 564- Spring 2018 WHAT IS THIS LECTURE ABOUT E/R Model: entity sets, attribute relation: binary, multi-way relationship roles, attributes on relationships subclasses (ISA) weak
More informationITFOOD: Indexing Technique for Fuzzy Object Oriented Database.
ITFOOD: Indexing Technique for Fuzzy Object Oriented Database. Priyanka J. Pursani, Prof. A. B. Raut Abstract: The Indexing Technique for Fuzzy Object Oriented Database Model is the extension towards database
More informationDatabase Fundamentals Chapter 1
Database Fundamentals Chapter 1 Class 01: Database Fundamentals 1 What is a Database? The ISO/ANSI SQL Standard does not contain a definition of the term database. In fact, the term is never mentioned
More informationFor our sample application we have realized a wrapper WWWSEARCH which is able to retrieve HTML-pages from a web server and extract pieces of informati
Meta Web Search with KOMET Jacques Calmet and Peter Kullmann Institut fur Algorithmen und Kognitive Systeme (IAKS) Fakultat fur Informatik, Universitat Karlsruhe Am Fasanengarten 5, D-76131 Karlsruhe,
More informationDatabase Technology Introduction. Heiko Paulheim
Database Technology Introduction Outline The Need for Databases Data Models Relational Databases Database Design Storage Manager Query Processing Transaction Manager Introduction to the Relational Model
More informationIncreasing Database Performance through Optimizing Structure Query Language Join Statement
Journal of Computer Science 6 (5): 585-590, 2010 ISSN 1549-3636 2010 Science Publications Increasing Database Performance through Optimizing Structure Query Language Join Statement 1 Ossama K. Muslih and
More informationCSE 403: Software Engineering, Spring courses.cs.washington.edu/courses/cse403/15sp/ UML Class Diagrams. Emina Torlak
CSE 403: Software Engineering, Spring 2015 courses.cs.washington.edu/courses/cse403/15sp/ UML Class Diagrams Emina Torlak emina@cs.washington.edu Outline Designing classes Overview of UML UML class diagrams
More informationThe Next Step: Designing DB Schema. Chapter 6: Entity-Relationship Model. The E-R Model. Identifying Entities and their Attributes.
Chapter 6: Entity-Relationship Model Our Story So Far: Relational Tables Databases are structured collections of organized data The Relational model is the most common data organization model The Relational
More informationMigrating to Object Data Management
Migrating to Object Data Management Arthur M. Keller * Stanford University and Persistence Software Paul Turner Persistence Software Abstract. We discuss issues of migrating to object data management.
More informationFundamentals of Health Workflow Process Analysis and Redesign
Fundamentals of Health Workflow Process Analysis and Redesign Unit 10.3d Process Mapping Gane-Sarson Notation Slide 1 Welcome to the Gane-Sarson Notation for Data Flow Diagrams Subunit. This is the third
More informationSoftware Engineering Fall 2014
Software Engineering Fall 2014 (CSC 4350/6350) Mon.- Wed. 5:30 pm 7:15 pm ALC : 107 Rao Casturi 10/01/2014 Class Announcements Grading is done for the Deliverable #2 (Requirement Elicitation) Will be posed
More informationApplicability Estimation of Mobile Mapping. System for Road Management
Contemporary Engineering Sciences, Vol. 7, 2014, no. 24, 1407-1414 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ces.2014.49173 Applicability Estimation of Mobile Mapping System for Road Management
More informationProject #1 rev 2 Computer Science 2334 Fall 2013 This project is individual work. Each student must complete this assignment independently.
Project #1 rev 2 Computer Science 2334 Fall 2013 This project is individual work. Each student must complete this assignment independently. User Request: Create a simple magazine data system. Milestones:
More informationImplementation of Semantic Information Retrieval. System in Mobile Environment
Contemporary Engineering Sciences, Vol. 9, 2016, no. 13, 603-608 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ces.2016.6447 Implementation of Semantic Information Retrieval System in Mobile
More informationA Mobile Application Development Tool based on Object Relational Mapping Solution
Indian Journal of Science and Technology, Vol 8(18), DOI: 10.17485/ijst/2015/v8i18/75937, August 2015 ISSN (Print) : 0974-6846 ISSN (Online) : 0974-5645 A Mobile Application Development Tool based on Object
More informationConcept as a Generalization of Class and Principles of the Concept-Oriented Programming
Computer Science Journal of Moldova, vol.13, no.3(39), 2005 Concept as a Generalization of Class and Principles of the Concept-Oriented Programming Alexandr Savinov Abstract In the paper we describe a
More informationIntroduction to SQL/PLSQL Accelerated Ed 2
Oracle University Contact Us: Local: 1800 103 4775 Intl: +91 80 67863102 Introduction to SQL/PLSQL Accelerated Ed 2 Duration: 5 Days What you will learn This Introduction to SQL/PLSQL Accelerated course
More informationCopyright 2007 Ramez Elmasri and Shamkant B. Navathe Slide 2-1
Copyright 2007 Ramez Elmasri and Shamkant B. Navathe Slide 2-1 Chapter 2 Database System Concepts and Architecture Copyright 2007 Ramez Elmasri and Shamkant B. Navathe Outline Data Models and Their Categories
More informationClustering using Fast Structural Hierarchy Extraction from User-Defined Tags for Semi-Structural Languages
Clustering using Fast Structural Hierarchy Extraction from User-Defined Tags for Semi-Structural Languages Hyun-Joo Moon, Haeng-kon Kim, Eun- Ser Lee, Member, IAENG Abstract Needs for semi-structured Languages
More informationS T R U C T U R A L M O D E L I N G ( M O D E L I N G A S Y S T E M ' S L O G I C A L S T R U C T U R E U S I N G C L A S S E S A N D C L A S S D I A
S T R U C T U R A L M O D E L I N G ( M O D E L I N G A S Y S T E M ' S L O G I C A L S T R U C T U R E U S I N G C L A S S E S A N D C L A S S D I A G R A M S ) WHAT IS CLASS DIAGRAM? A class diagram
More informationDesign and Implementation of an RDF Triple Store
Design and Implementation of an RDF Triple Store Ching-Long Yeh and Ruei-Feng Lin Department of Computer Science and Engineering Tatung University 40 Chungshan N. Rd., Sec. 3 Taipei, 04 Taiwan E-mail:
More informationAuto-focusing Technique in a Projector-Camera System
2008 10th Intl. Conf. on Control, Automation, Robotics and Vision Hanoi, Vietnam, 17 20 December 2008 Auto-focusing Technique in a Projector-Camera System Lam Bui Quang, Daesik Kim and Sukhan Lee School
More informationModeling Cooperative Behavior Using Cooperation Contracts. Peter Lang. Abstract
Modeling Cooperative Behavior Using Cooperation Contracts Michael Schre Department of Data & Knowledge Engineering University of Linz Altenbergerstr. 69, A-4040 Linz, Austria schre@dke.uni-linz.ac.at Gerti
More informationProceedings of International Computer Symposium 1994, Dec , NCTU, Hsinchu, Taiwan, R.O.C. 1172
Proceedings of International Computer Symposium 1994, Dec. 12-15, NCTU, Hsinchu, Taiwan, R.O.C. 1172 Short Cuts for Traversals in Object-Oriented Database Systems Wang-Chien Lee and Dik Lun Lee Department
More informationR.S. Pressman & Associates, Inc. For University Use Only
Software Engineering: A Practitioner s Approach, 6/e Chapter 10 Architectural Design copyright 1996, 2001, 2005 R.S. Pressman & Associates, Inc. For University Use Only May be reproduced ONLY for student
More informationTable of Contents. PDF created with FinePrint pdffactory Pro trial version
Table of Contents Course Description The SQL Course covers relational database principles and Oracle concepts, writing basic SQL statements, restricting and sorting data, and using single-row functions.
More informationDomain-specific Concept-based Information Retrieval System
Domain-specific Concept-based Information Retrieval System L. Shen 1, Y. K. Lim 1, H. T. Loh 2 1 Design Technology Institute Ltd, National University of Singapore, Singapore 2 Department of Mechanical
More informationACS-3902 Fall Ron McFadyen 3D21 Slides are based on chapter 5 (7 th edition) (chapter 3 in 6 th edition)
ACS-3902 Fall 2016 Ron McFadyen 3D21 ron.mcfadyen@acs.uwinnipeg.ca Slides are based on chapter 5 (7 th edition) (chapter 3 in 6 th edition) 1 The Relational Data Model and Relational Database Constraints
More informationMeasurement-based Static Load Modeling Using the PMU data Installed on the University Load
Journal of Electrical Engineering & Technology Vol. 7, No. 5, pp. 653~658, 202 653 http://dx.doi.org/0.5370/jeet.202.7.5.653 Measurement-based Static Load Modeling Using the PMU data Installed on the University
More informationResearch on Construction of Road Network Database Based on Video Retrieval Technology
Research on Construction of Road Network Database Based on Video Retrieval Technology Fengling Wang 1 1 Hezhou University, School of Mathematics and Computer Hezhou Guangxi 542899, China Abstract. Based
More informationOverview of db design Requirement analysis Data to be stored Applications to be built Operations (most frequent) subject to performance requirement
ITCS 3160 Data Base Design and Implementation Jing Yang 2010 Fall Class 12: Data Modeling Using the Entity-Relationship (ER) Model Overview of db design Requirement analysis Data to be stored Applications
More informationCSC148, Lab #4. General rules. Overview. Tracing recursion. Greatest Common Denominator GCD
CSC148, Lab #4 This document contains the instructions for lab number 4 in CSC148H. To earn your lab mark, you must actively participate in the lab. We mark you in order to ensure a serious attempt at
More informationA Kinect Sensor based Windows Control Interface
, pp.113-124 http://dx.doi.org/10.14257/ijca.2014.7.3.12 A Kinect Sensor based Windows Control Interface Sang-Hyuk Lee 1 and Seung-Hyun Oh 2 Department of Computer Science, Dongguk University, Gyeongju,
More informationTutorial notes on. Object relational structural patterns
Tutorial notes on Object relational structural patterns Dr. C. Constantinides, P.Eng. Computer Science and Software Engineering Concordia University Page 1 of 14 Exercise 1. a) Briefly describe what is
More informationEntity-Relationship Models: Good Design and Constraints
Entity-Relationship Models: Good Design and T. M. Murali September 29, 2010 T. M. Murali September 29, 2010 CS 4604: E/R Design and Guidelines Be faithful to the specification of the application. Avoid
More informationCan We Trust SQL as a Data Analytics Tool?
Can We Trust SQL as a Data nalytics Tool? SQL The query language for relational databases International Standard since 1987 Implemented in all systems (free and commercial) $30B/year business Most common
More informationChapter 12 Object and Object Relational Databases
Chapter 12 Object and Object Relational Databases - Relational Data Model - Object data model (OODBs) - Object-relational data models Traditional data models -network - hierarchical - relational They lack
More informationUSER SPECIFICATIONS. 2 Physical Constraints. Optimized Algebraic Representation. Optimization
Bulk Loading Techniques for Object Databases and an Application to Relational Data Sihem Amer-Yahia, Sophie Cluet and Claude Delobel contact author: Sihem Amer-Yahia, INRIA, BP 105, 78153 Le Chesnay, France
More informationA stack eect (type signature) is a pair of input parameter types and output parameter types. We also consider the type clash as a stack eect. The set
Alternative Syntactic Methods for Dening Stack Based Languages Jaanus Poial Institute of Computer Science University of Tartu, Estonia e-mail: jaanus@cs.ut.ee Abstract. Traditional formal methods of syntax
More information