(12) United States Patent (10) Patent N0.2 US 7,844,612 B2 Colgrave Et Al

Total Page:16

File Type:pdf, Size:1020Kb

(12) United States Patent (10) Patent N0.2 US 7,844,612 B2 Colgrave Et Al US007844612B2 (12) United States Patent (10) Patent N0.2 US 7,844,612 B2 Colgrave et al. (45) Date of Patent: *Nov. 30, 2010 (54) METHOD FOR PRUNING OBJECTS IN A (58) Field of Classi?cation Search ..................... .. None SERVICE REGISTRY AND REPOSITORY See application ?le for complete search history. (75) Inventors: John Colgrave, Eastleigh (GB); Alexis (56) References Clted Lee, Southampton (GB); Manfred U.S. PATENT DOCUMENTS Oevers, Tuebingen (DE); Andrew 5,504,885 A * 4/1996 Alashqur .................. .. 717/141 Rutherford, Southampton (GB); 2005/0097224 A1 * 5/2005 Chen et a1. .. 709/246 Samuel Jonathan Smith, Southampton 2007/0027905 A1 * 2/2007 Warren et a1. ......... .. 707/l03 R (GB) * cited by examiner (73) Assignee: International Business Machines P 1’ imary ExamineriUyen T~ Le Corporation, Armonk, NY (Us) (74)Allorney, Agent, or Firmileanine S. Ray-Yarletts, Esq.; Steven M. Greenberg, Esq.; Carey Rodriguez Greenberg & ( * ) Notice: Subject to any disclaimer, the term of this Paul, LLP patent is extended or adjusted under 35 U.S.C. 154(1)) by 398 days. (57) ABSTRACT Embodiments of the invention relate to a service registry and This Pawnt is Subject to a terminal dis- repository system, method and computerprogramproduct for Claimer- accessing objects in an object repository. There is provided a method of managing an object database for objects that (21) APP1~ NO-3 11/ 844,299 includes receiving an object query; querying the object data base using the object query; receiving a hierarchical collec (22) Filed? Allg- 23: 2007 tion of objects including a root object; and returning only _ _ _ those objects that are Within a speci?c depth of the root object (65) Pnor Pubhcatlon Data and that do not represent user-de?ned relationships. The Us 2009/0055410 A1 Feb 26’ 2009 returning step maps the objects from a proprietary object format into a standard object format and optionally the stan (51) Int, Cl, dard object format is the Service De?nition Object format G06F 17/00 (2006.01) ($130) G06F 7/00 (2006.01) (52) US. Cl. .................................................... .. 707/754 7 Claims, 10 Drawing Sheets 800. Object Graph Pruning, Get whole graph 822 node:= node.parent 802 node := root i:=0 i:=i-1 804 node:= nodenextchild NO 806. Is node user de?ned’? 816 node:= node.parent 812. Cut 814. Is Node:=node.parent node user de?ned? 824 Return pruned graph to L user US. Patent Nov. 30, 2010 Sheet 1 0f 10 US 7,844,612 B2 8.2mm \wmE?mmmEEQv wmcozwonom 65020 Ezoz?oqO ucm>oco_oEw 8:26am 9 cw J\JamEzczm:ozEmQE 83.6w\Ewmmmm2268mmUcm Ah mSmEF 022mm EoEa2m>mQ 20523 @wEEmww< 09:2095 336$ EmEmmmcmé é® US. Patent Nov. 30, 2010 Sheet 2 0f 10 US 7,844,612 B2 N_.P9532200 w.moma. 225mm2.3.6 92mm225: 3>350.EmmcmE 2.5500-502 Ems-mmam-um ohmsawnmg320wcormo=aa<w H oo~t2£on 52-2200wmmuo<#N 5.805820- 22332553‘ E wSmEN 3.2mmahoznwnmgizmoaom0cmPaw-mom2 mm002.5“: onmanta“: $2.. mEEEEmoE ‘w ‘r cumocmEo>00 20533 95:202.: US. Patent Nov. 30, 2010 Sheet 4 0f 10 US 7,844,612 B2 >650Nmv3:35 Eng-2E050vmv SE02:Bmmw2002vowm9: NT?UUOCLawn-Xmm:LOwwQOOLQ NO@2002LONE-J00 528wmom.220233 wow6552662mm o5@266EOEhoumhmcmm wSmEv 6528:.>6505mm?oov 6652ouoz96go?mhocom 3520“02mm$3“63656 65mm:405?ucmhoumhmcmm 22.03$029: wow55mm:EmQX oEvBEE? 2% US. Patent Nov. 30, 2010 Sheet 9 0f 10 US 7,844,612 B2 mSmEm ?eo?mso8m @2522samba6.930$0 % o>oEom.Nom6w: vmccmuB850 % E5052gm25 8.2mm60.505558 52mm.womuwaQmE #63052m US. Patent Nov. 30, 2010 Sheet 10 0f 10 US 7,844,612 B2 :58£965wNu F13NED 022:5 <223mm m! 2. :58£665oPu F. m3 P 2:5m2 F5 US 7,844,612 B2 1 2 METHOD FOR PRUNING OBJECTS IN A mark or trademark of International Business Machines Cor SERVICE REGISTRY AND REPOSITORY poration in the United States and/or other countries. XMeta Query Language @(MQL) is a declarative object RELATED APPLICATIONS query language designed for the e?icient retrieval of objects stored in a repository such as WSRR. XMQL alloWs the use The present application is related to a concurrently ?led, of the dot operator for accessing prede?ned properties on a copending US. patent application Ser. No. 11/844,322 given modelled object type. XMQL also alloWs a dereferenc entitled “SYSTEM AND PROGRAM PRODUCTS FOR PRUNING OBJECTS IN A SERVICE REGISTRY AND ing operator for traversing relationships betWeen any tWo REPOSITORY”. given object types. The XMQL query expression is de?ned in This invention relates to a service registry and repository the context of a given package registered With WSRR. XMQL system and method. In particular this invention relates to a has a “SELECT-FROM-WHERE” type of structure and service registry and repository system and method for prun returns a set of objects. ing objects in an object repository. The SELECT-FROM-WHERE clause is the basic structure of an XMQL query. It alloWs the user to specify Which class BACKGROUND (es) should be searched to retrieve information, and Which parts of the information to be included in the results set. It also A service registry and repository registers and stores ser alloWs the user to specify conditions to ?lter out of the results vice descriptions as part of a service-oriented architecture set the instances that do not meet the conditions. (SOA) promising business agility and resilience through 20 The SELECT clause de?nes the structure of the query reuse, loose coupling, ?exibility, interoperability, integration result, Which can be either a collection of objects, or a col and governance. These promises are addressed by separating lection of roWs With the selected attribute values. The entries service descriptions from their implementations, and using in the select part of a query constitute the so-called projection the service descriptions across the life cycle of the service. list of the query, in that they de?ne What is projected out of the Standards-based service metadata artefacts, such as Web Ser 25 repository and into the result set entries (result objects or vice De?nition Language (WSDL), XML schema, policy or result roWs of atomic values, depending on the number and Service Component Architecture (SCA) documents, capture type of the entries in the projection list). When retrieved, the the technical details of What a service can do, hoW it can be type of the query result is a List of instances of objects, or a invoked, or What it expects other services to do. Semantic List of arrays (result roWs) of instances of objects (result roW annotations and other metadata can be associated With these 30 columns). artefacts to offer insight to potential users of the service on The FROM clause introduces the primary class extent hoW and When it can be used, and What purposes it serves. against Which the query runs. A class extent is the set of all Service descriptions are used by analysts, architects, and instances of a given class (including instances of its sub developers during a Development Phase of the SOA life cycle classes). A variable needs to be declared to iterate over the to locate services to reuse and to evaluate the impact of 35 instances of the class being queried, the so-called primary changes to service con?gurations. Service descriptions are used by deployers in a Change and Release Phase and by iteration variable. That variable can be used in the other parts of the query and denotes an instance of the class extent being administrators in a Runtime Integration Phase. It is used in the Operation Phase of the life cycle to support policy enforce iterated upon. The FROM clause also alloWs the introduction of other variables to iterate over instances that can be reached ment required by Service Level Agreements (SLAs) and to 40 through navigation via multiplicityimany references from present a more comprehensive vieW of the managed service previously introduced iteration variables. These extra vari environment. Service descriptions are used by various tech ables are called secondary iteration variables. As explained nologies for different purposes and needs to be persisted in a reliable and accessible format. Service descriptions are vari above, unquali?ed class names in a query expression are resolved relative to that package, the so called query context ously described as metadata, objects, documents, entities and 45 artefacts. package. A service registry and repository is an application that The WHERE clause introduces a predicate that ?lters the persists service descriptions as a data objects in a relational instances of the class being queried. This is an optional sub database system. Typically a user uses a graphical tool to clause. design classes that represent the service descriptions that 50 The basic SELECT-FROM-WHERE structure can be need to be persisted. Java objects, that represent the classes, extended With other optional clauses. are compiled into binary ?les. Database schema is generated Example 1: SELECT e FROM e in Employee WHERE that can represent the objects and is installed into a relational e.salary>200000. This query returns the instance(s) of class database (IBM® DB2®, Oracle etc). The objects are regis Employee (including any of its sub-classes) Whose salary tered With service register and stored Within the repository. 55 attribute value is greater than 200000. The FROM clause The objects are persisted and retrieved directly from the gives the class Whose extent the query Will ?lter, class object database. IBM and DB2 are registered trademarks or Employee, and introduces the variable ‘e’ to be used to iterate trademarks of International Business Machines Corporation over that class extent.
Recommended publications
  • CS145 Lecture Notes #15 Introduction to OQL
    CS145 Lecture Notes #15 Introduction to OQL History Object-oriented DBMS (OODBMS) vendors hoped to take market share from traditional relational DBMS (RDBMS) vendors by offer- ing object-based data management Extend OO languages (C++, SmallTalk) with support for persis- tent objects RDBMS vendors responded by adding object support to relational systems (i.e., ORDBMS) and largely kept their customers OODBMS vendors have survived in another market niche: software systems that need some of their data to be persistent (e.g., CAD) Recall: ODMG: Object Database Management Group ODL: Object De®nition Language OQL: Object Query Language Query-Related Features of ODL Example: a student can take many courses but may TA at most one interface Student (extent Students, key SID) { attribute integer SID; attribute string name; attribute integer age; attribute float GPA; relationship Set<Course> takeCourses inverse Course::students; relationship Course assistCourse inverse Course::TAs; }; interface Course (extent Courses, key CID) { attribute string CID; attribute string title; relationship Set<Student> students inverse Student::takeCourses; relationship Set<Student> TAs inverse Student::assistCourse; }; Jun Yang 1 CS145 Spring 1999 For every class we can declare an extent, which is used to refer to the current collection of all objects of that class We can also declare methods written in the host language Basic SELECT Statement in OQL Example: ®nd CID and title of the course assisted by Lisa SELECT s.assistCourse.CID, s.assistCourse.title FROM Students
    [Show full text]
  • EYEDB Object Query Language
    EYEDB Object Query Language Version 2.8.8 December 2007 Copyright c 1994-2008 SYSRA Published by SYSRA 30, avenue G´en´eral Leclerc 91330 Yerres - France home page: http://www.eyedb.org Contents 1 Introduction....................................... ............... 5 2 Principles ........................................ ............... 5 3 OQLvs.ODMG3OQL.................................... ........... 5 4 Language Concepts . ........... 7 5 Language Syntax . .......... 8 5.1 TerminalAtomSyntax.................................. .......... 8 5.2 Non Terminal Atom Production . 10 5.3 Keywords.......................................... 11 5.4 Comments.......................................... 11 5.5 Statements ........................................ 12 5.6 ExpressionStatements............................... 12 5.7 AtomicLiteralExpressions ............................ 14 5.8 ArithmeticExpressions ............................. 14 5.9 AssignmentExpressions .............................. 18 5.10 Auto Increment & Decrement Expressions . 19 5.11 Comparison Expressions . 20 5.12 Logical Expressions . 24 5.13 Conditional Expression . 24 5.14 ExpressionSequences ............................... 25 5.15 ArrayDeferencing ................................. 25 5.16 IdentifierExpressions .............................. 28 5.17 PathExpressions.................................... 32 5.18 FunctionCall....................................... 33 5.19 MethodInvocation................................... 34 5.20 Eval/Unval Operators . 37 5.21 SetExpressions...................................
    [Show full text]
  • SOQL and SOSL Reference
    SOQL and SOSL Reference Version 53.0, Winter ’22 @salesforcedocs Last updated: August 26, 2021 © Copyright 2000–2021 salesforce.com, inc. All rights reserved. Salesforce is a registered trademark of salesforce.com, inc., as are other names and marks. Other marks appearing herein may be trademarks of their respective owners. CONTENTS Chapter 1: Introduction to SOQL and SOSL . 1 Chapter 2: Salesforce Object Query Language (SOQL) . 3 Typographical Conventions in This Document . 5 Quoted String Escape Sequences . 5 Reserved Characters . 6 Alias Notation . 7 SOQL SELECT Syntax . 7 Condition Expression Syntax (WHERE Clause) . 9 fieldExpression Syntax . 13 USING SCOPE . 26 ORDER BY . 27 LIMIT . 28 OFFSET . 29 FIELDS() . 31 Update an Article’s Keyword Tracking with SOQL . 35 Update an Article Viewstat with SOQL . 35 WITH filteringExpression . 35 GROUP BY . 40 HAVING . 47 TYPEOF . 48 FORMAT () . 51 FOR VIEW . 51 FOR REFERENCE . 52 FOR UPDATE . 52 Aggregate Functions . 53 Date Functions . 58 Querying Currency Fields in Multi-Currency Orgs . 60 Example SELECT Clauses . 62 Relationship Queries . 63 Understanding Relationship Names . 64 Using Relationship Queries . 65 Understanding Relationship Names, Custom Objects, and Custom Fields . 66 Understanding Query Results . 68 Lookup Relationships and Outer Joins . 70 Identifying Parent and Child Relationships . 70 Understanding Relationship Fields and Polymorphic Fields . 72 Understanding Relationship Query Limitations . 77 Using Relationship Queries with History Objects . 77 Contents Using Relationship Queries with Data Category Selection Objects . 78 Using Relationship Queries with the Partner WSDL . 78 Change the Batch Size in Queries . 78 SOQL Limits on Objects . 79 SOQL with Big Objects . 83 Syndication Feed SOQL and Mapping Syntax .
    [Show full text]
  • Query Service Specification
    Query Service Specification Version 1.0 New Edition: April 2000 Copyright 1999, FUJITSU LIMITED Copyright 1999, INPRISE Corporation Copyright 1999, IONA Technologies PLC Copyright 1999, Objectivity Inc. Copyright 1991, 1992, 1995, 1996, 1999 Object Management Group, Inc. Copyright 1999, Oracle Corporation Copyright 1999, Persistence Software Inc. Copyright 1999, Secant Technologies Inc. Copyright 1999, Sun Microsystems Inc. The companies listed above have granted to the Object Management Group, Inc. (OMG) a nonexclusive, royalty-free, paid up, worldwide license to copy and distribute this document and to modify this document and distribute copies of the modified version. Each of the copyright holders listed above has agreed that no person shall be deemed to have infringed the copyright in the included material of any such copyright holder by reason of having used the specification set forth herein or having conformed any computer software to the specification. PATENT The attention of adopters is directed to the possibility that compliance with or adoption of OMG specifications may require use of an invention covered by patent rights. OMG shall not be responsible for identifying patents for which a license may be required by any OMG specification, or for conducting legal inquiries into the legal validity or scope of those patents that are brought to its attention. OMG specifications are prospective and advisory only. Prospective users are responsible for protecting themselves against liability for infringement of patents. NOTICE The information contained in this document is subject to change without notice. The material in this document details an Object Management Group specification in accordance with the license and notices set forth on this page.
    [Show full text]
  • Sciql, a Query Language for Science Applications
    SciQL, A Query Language for Science Applications M. Kersten, N. Nes, Y. Zhang, M. Ivanova CWI, Netherlands ABSTRACT technology has long been recognized [6, 34, 15, 18, 9, 20, 16, 4, Scientific applications are still poorly served by contemporary re- 31]. In particular, an efficient implementation of array and time lational database systems. At best, the system provides a bridge series concepts is missing [15, 34, 24, 1]. The main problems en- towards an external library using user-defined functions, explicit countered with relational systems in science can be summed up as import/export facilities or linked-in Java/C# interpreters. Time has (a) the impedance mismatch between query language and array ma- come to rectify this with SciQL1, a SQL-query language for science nipulation, (b) SQL is verbose for simple array expressions, (c) AR- applications with arrays as first class citizens. It provides a seam- RAYs are not first class citizens, (d) ingestion of Tera-bytes data is less symbiosis of array-, set-, and sequence- interpretation using too slow. The traditional DBMS simply carries too much overhead. a clear separation of the mathematical object from its underlying Moreover, much of the science processing involves use of standard storage representation. libraries, e.g., Linpack, and statistics tools, e.g., R. Their interac- The language extends value-based grouping in SQL with struc- tion with a database is often confined to a simplified import/export tural grouping, i.e., fixed-sized and unbounded groups based on dataset facility. A workflow management system is indispensable explicit relationships between its index attributes.
    [Show full text]
  • Object Persistence
    Object Persistence Object Oriented Programming Introduction • One of the most critical tasks that applications have to perform is to save and restore data • Persistence is the storage of data from working memory so that it can be restored when the application is run again • In object-oriented systems, there are several ways in which objects can be made persistent • The choice of persistence method is an important part of the design of an application Object Oriented Programming Object Serialization Object Oriented Programming Object Serialization • Simple persistence method which provides a program the ability to read or write a whole object to and from a stream of bytes • Allows Java objects to be encoded into a byte stream suitable for streaming to a file on disk or over a network • The class must implement the Serializable interface (java.io.Serializable), which does not declare any methods, and have accessors and mutators for its attributes Object Oriented Programming Object Serialization // create output stream File file = new File("teams_serialize.ser"); String fullPath = file.getAbsolutePath(); fos = new FileOutputStream(fullPath); // open output stream and store team t1 out = new ObjectOutputStream(fos); out.writeObject(t1); Object Oriented Programming Using Databases • Most Client-Server applications use a RDBMS as their data store while using an object-oriented programming language for development • Objects must be mapped to tables in the database and vice versa • Applications generally require the use of SQL statements embedded
    [Show full text]
  • Object Database Management Systems: Concepts and Features
    nIST Special Publication 500-179 Computer Systems Object Database Technology Management Systems: U.S. DEPARTMENT OF COMMERCE National Institute of Concepts and Features Standards and Technology Christopher E. Dabrowski Nisr Elizabeth N. Fong Deyuan Yang NAT L INST. OF STAND & TECH R.I.C, A111D3 3aTS7t, REFERENCE NIST PUBLICATIONS -QC" 100 U57 500-179 1990 NATIONAL MSTrrUTE OF STANDARDS & TECHNOLOGY Research Informatm Center Gaithersburg, MD 20899 NIST Special Publication 500-179 t Object Database Management Systems: Concepts and Features Christopher E. Dabrowski Elizabeth N. Fong Deyuan Yang National Computer Systems Laboratory National Institute of Standards and Technology Gaithersburg, MD 20899 April 1990 U.S. DEPARTMENT OF COMMERCE Robert A. Mosbacher, Secretary NATIONAL INSTITUTE OF STANDARDS AND TECHNOLOGY John W. Lyons, Director Reports on Computer Systems Technology The National Institute of Standards and Technology (NIST) (formerly the National Bureau of Standards) has a unique responsibility for computer systems technology within the Federal government. NIST's National Computer Systems Laboratory (NCSL) develops standards and guidelines, provides technical assistance, and conducts research for computers and related telecommunications systems to achieve more effective utilization of Federal information technology resources. NCSL's responsibilities include development of technical, management, physical, and administrative standards and guidelines for the cost-effective security and privacy of sensitive unclassified information processed in Federal computers. NCSL assists agencies in developing security plans and in improving computer security awareness train- ing. This Special Publication 500 series reports NCSL research and guidelines to Federal agencies as well as to organizations in industry, government, and academia. National Institute of Standards and Technology Special Publication 500-179 Natl.
    [Show full text]
  • 1 Query Languages This Section Lists All the Query Languages That the Query Language Investigation Team Determined Were Relevant Possibilities
    1 Query Languages This section lists all the query languages that the Query Language Investigation team determined were relevant possibilities: 1.1 XPath Reference: http://www.w3.org/TR/xpath20/ 1.2 XQuery Reference: http://www.w3.org/XML/Query 1.3 XQL Reference: http://www.ibiblio.org/xql/xql-proposal.html 1.4 OQL Reference: http://www.odmg.org/ 1.5 SQL Reference: http://www.ansi.org/ 1.6 DMQL2 Reference: http://www.rets-wg.org/docs/index.html 2 XPath Query Language Comparison 2.1 XPath Language Definition XPath was designed to be used (by XSLT and XPointer) to address parts of an XML document either by location or by pattern matching capabilities exercised on content at those locations. Pattern matching is facilitated via string manipulation, numeric operations, and Boolean logic functionality. The language uses a compact, non-XML syntax that operates on the hierarchical structure of an XML document. Each XPath expression operates starting from the current context (a node within the document) and yields a node set, a boolean value, a number, or a string; expressions can be nested. The language consists of 37 tokens and 27 functions. 13 of the tokens are related to location, 14 to pattern matching, and 10 to the lexical structure. The functions deal with node identification, string manipulation, conversion to and numeric manipulation, and Boolean evaluation. Given that it operates on an XML document, to be used as the RETS query language between a client and a server XPath would require that the client and server share a common XML document representation of the data to be searched.
    [Show full text]
  • Apache Calcite for Enabling SQL Access to Nosql Data Systems Such As Apache Geode Christian Tzolov Whoami Christian Tzolov
    Apache Calcite for Enabling SQL Access to NoSQL Data Systems such as Apache Geode Christian Tzolov Whoami Christian Tzolov Engineer at Pivotal, Big-Data, Hadoop, Spring Cloud Dataflow, Apache Geode, Apache HAWQ, Apache Committer, Apache Crunch PMC member [email protected] blog.tzolov.net twitter: @christzolov https://nl.linkedin.com/in/tzolov Disclaimer This talk expresses my personal opinions. It is not read or approved by Pivotal and does not necessarily reflect the views and opinions of Pivotal nor does it constitute any official communication of Pivotal. Pivotal does not support any of the code shared here. 2 Big Data Landscape 2016 • Volume • Velocity • Varity • Scalability • Latency • Consistency vs. Availability (CAP) 3 Data Access • {Old | New} SQL • Custom APIs – Key / Value – Fluent APIs – REST APIs • {My} Query Language Unified Data Access? At What Cost? 4 SQL? • Apache Apex • SQL-Gremlin • Apache Drill … • Apache Flink • Apache Geode • Apache Hive • Apache Kylin • Apache Phoenix • Apache Samza • Apache Storm • Cascading • Qubole Quark 5 Geode Adapter - Overview SQL/JDBC/ODBC Parse SQL, converts into relational expression and Apache Calcite optimizes Push down the relational expressions supported by Geode Spring Data API for Enumerable OQL and falls back to the Calcite interacting with Geode Adapter Enumerable Adapter for the rest Convert SQL relational Spring Data Geode Adapter expressions into OQL queries Geode (Geode Client) Geode API and OQL Geode Server Geode Server Geode Server Data Data Data SQL Relational Expressions
    [Show full text]
  • ODL, OQL and SQL3 Object Definition Language
    ODL, OQL and SQL3 CSC 436 – Fall 2003 * Notes kindly borrowed from D R AZIZ AIT -BRAHAM, School of Computing, IS & Math, South Bank University 1 Object Definition Language oObjectives – Portability of database schemas across ODBMS – Interoperability of ODBMSs from multiple vendors oDevelopment principles – All semantic constructs of ODMG object model – Specification language (not full programming language) – Program language independence – OMG IDL (Interface Definition Language) compatibility – Practical and short time implementable 2 Type Specification oA type is defined by specifying its interface in ODL oTop-level BNF type definition ::= interface <type_name> [:<supertype_list>} { [<type_property_list>] [<property_list>] [<operation_list>] }; oAny list may be omitted if not applicable 3 Type Characteristics Specification oType characteristics – Supertypes – Extent naming – Key(s) oExample interface Professor :Person { extent professors; keys faculty_id, soc_sec_no; <property_list> <operation_list }; oNotes – No more than one extent or key definition. Each attribute or relationship traversal name in key definition should be specified in the property list – Extent naming and key definition may appear in any order – Supertype, extent naming and key definition may be omitted if not applicable 4 Property List oBNF <property_list ::== <property_spec>; | <property_spec><property_list> <property_spec>::= <attribute_spec> | <relationship_spec> oStructured types have bracketed list of field-type pairs associated with them. oEnumerated types
    [Show full text]
  • A Query Language for Analyzing Information Networks
    BiQL: a query language for analyzing information networks Anton Dries1,2, Siegfried Nijssen1 and Luc De Raedt1 1 Katholieke Universiteit Leuven, Belgium 2 Universitat Pompeu Fabra, Barcelona, Spain Abstract. One of the key steps in data analysis is the exploration of data. For traditional relational data, this process is facilitated by rela- tional database management systems and the aggregates and rankings they can compute. However, for the exploration of graph data, relational databases may not be most practical and scalable. Many tasks related to exploration of information networks involve computation and analy- sis of connections (e.g. paths) between concepts. Traditional relational databases o↵er no specific support for performing such tasks. For in- stance, a statistic such as the shortest path between two given nodes cannot be computed by a relational database. Surprisingly, tools for querying graph and network databases are much less well developed than for relational data, and only recently an increasing number of studies are devoted to graph or network databases. Our position is that the devel- opment of such graph databases is important both to make basic graph mining easier and to prepare data for more complex types of analysis. In this chapter, we present the BiQL data model for representing and manipulating information networks. The BiQL data model consists of two parts: a data model describing objects, link, domains and networks, and a query language describing basic network manipulations. The main focus here lies on data preparation and data analysis, and less on data mining or knowledge discovery tasks directly. 1 Introduction Information networks are a popular way of representing information.
    [Show full text]
  • 002.02 Comparing the Object and the Relational Data Model
    Paterson_656-0 C03.fm Page 31 Friday, March 31, 2006 3:50 PM CHAPTER 3 ■ ■ ■ Comparing the Object and Relational Data Models When people talk about databases, they almost always mean relational databases. This wasn’t always the case, though, as databases existed before the relational data model was developed. Now, the case for considering alternatives has become stronger with the increasing dominance of object-oriented languages in a widening range of application areas, and with the emergence of native object databases such as db4o. It’s vital to understand the benefits and limitations of today’s data models, particularly in the context of object-oriented systems. This chapter describes the evolution of data models, including the relational and the object-based “post-relational” models, and compares their characteristics, both good and bad. It discusses the strategies needed to make the relational model work with object-oriented systems. It then describes how object databases reflect the features expected in relational databases. The next chapter will examine the object data model in detail, and explain how this model is applied in db4o. Data Models Before the first DBMS was developed, programs accessed data from flat files. These did not allow representation of logical data relationships or enforcement of data integrity. Data modeling has developed over successive generations since the 1960s to provide applications with more powerful data storage features. In this chapter we will look at the differences between data models, concentrating on the relational model and the object model. Generally speaking, data models have evolved in three generations. The early generation data models tend to refuse to completely go away, however.
    [Show full text]