ACM Home Page
Please provide us with feedback. Feedback
An implementation model for reasoning with complex objects
Full text PdfPdf (987 KB)
Source International Conference on Management of Data archive
Proceedings of the 1988 ACM SIGMOD international conference on Management of data table of contents
Chicago, Illinois, United States
Pages: 164 - 172  
Year of Publication: 1988
ISBN:0-89791-268-3
Also published in ...
Authors
Qiming Chen  SM Research Institute, 16 Bei Tai Ping Lu, Beijing 100039, CHINA
Georges Gardarin  INRIA & UNIV PARIS VI, SABRE, Project, BP 105, 78153 LE CHESNAY, FRANCE
Sponsor
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 13,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/50202.50220
What is a DOI?

ABSTRACT

In this paper, we first propose a natural syntactical extension of DATALOG called NESTED_DATALOG for dealing with complex objects represented as nested predicates. Then, we introduce the token object model which is a simple extension of the relational model with tokens to represent complex objects and support referential information sharing. An implementation model of a NESTED_DATALOG program is defined by mapping it to the token object model which remains a straightforward extension of classical logical databases. Through this work, we can accommodate two basic requirements. The availability of a rule language for reasoning with complex objects, and the mechanism for mapping a complex object rule program to a relational DBMS offering a pure DATALOG rule language. In summary, the main contributions of the paper are the definition of a rule language for complex objects and the development of a technique to compile this complex object rule language to classical DATALOG.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
Abiteboul 87
S Ablteboul, S Grumbach, "Une Approche Loglque de la Mampulatlon d'objets Complexes", 3e Joum~es BD3, Port Camargue, Mal 1987
 
Al-Amoudi87
Al-Amoudl S, Harper D, "On Compiling Loglc Programming Languages into Conventional Relational Algebra Operations", Internal Report, Umverslty of Glasgow, UK, 1987
 
Apt86
Apt K R-, Blatr H, Walker A ,"Towards a Theory of Declarative Knowledge". IBM Research Report RC 11681, Aprtl 1986, xn Proc Workshop on Foundattons of Deducuve Databases and Logic Programming, Washington D C, pp 546,629, 1986
 
Bancilhon 86
F Bancflhon and S Khoshafian, "Objects Calculus", Proc PODS, 1986
 
Beeri 86
C Been et al, "Sets and Negation m a Logic Database Language LDLI", MCC Tec Rep, 1986
Chen 86
 
Chen 87
Q Chen, "An Extended Object-Onented Database approach", Approach", Proc of COMPSAC 87. Japan, 1987
 
Gardarin 87a
 
Gardarin 87b
G Gardarm, E Simon, "Les Syst~mes de Bases de Donn?,es D&tuctlves", TSI, Dunod Ed, March 1988, m French
 
Gardarin88
G Gardarm, P Valdunez, "Prmclples and Algorithms of Relauonal Database Systems", Book, Addison-Wesley, 1988
Gallaire84
Khoshafian 86
 
Kiernan87
KJernan G, Monze i, "Braiding an Object~ oriented Interface Over an Extended Relational Backend", Progress Report. ISIDE ESPRIT Project. N 221, Oct 1987
Kuper 87
 
Maier 83
 
Reiter84
Retter R "Towards a Logxcal Reconstruction of Relational Database Theor3,", m On Conceptual Modelhng, Book, Pp 191-234, Sprmger-Verlag Ed. 1984
 
Tsur 86
Woelk 86
 
Zaniolo 85
C Zaniolo, "The Representation and Deductive Retrieval of Complex Objects", Proc VLDB 11, Stockolm, 1985


Collaborative Colleagues:
Qiming Chen: colleagues
Georges Gardarin: colleagues

Peer to Peer - Readers of this Article have also read: