An XML Data Model for Inverted Image Indexing

2003 ◽  
Author(s):  
Simon W. So ◽  
Clement H. C. Leung ◽  
Philip K. C. Tse
Keyword(s):  
Author(s):  
Jovana Vidaković ◽  
Sonja Ristić ◽  
Slavica Kordić ◽  
Ivan Luković
Keyword(s):  

2004 ◽  
Vol 4 (3) ◽  
pp. 239-287 ◽  
Author(s):  
WOLFGANG MAY

We define XPathLog as a Datalog-style extension of XPath. XPathLog provides a clear, declarative language for querying and manipulating XML whose perspectives are especially in XML data integration. In our characterization, the formal semantics is defined wrt. an edge-labeled graph-based model, which covers the XML data model. We give a complete, logic-based characterization of XML data and the main language concept for XML, XPath. XPath-Logic extends the XPath language with variable bindings and embeds it into first-order logic. XPathLog is then the Horn fragment of XPath-Logic, providing a Datalog-style, rule-based language for querying and manipulating XML data. The model-theoretic semantics of XPath-Logic serves as the base of XPathLog as a logic-programming language, whereas also an equivalent answer-set semantics for evaluating XPathLog queries is given. In contrast to other approaches, the XPath syntax and semantics is also used for a declarative specification how the database should be updated: when used in rule heads, XPath filters are interpreted as specifications of elements and properties which should be added to the database.


IEEE Access ◽  
2018 ◽  
Vol 6 ◽  
pp. 22025-22033 ◽  
Author(s):  
Weijun Li ◽  
Li Yan ◽  
Fu Zhang ◽  
Xu Chen

2018 ◽  
Vol 15 (3) ◽  
pp. 821-843
Author(s):  
Jovana Vidakovic ◽  
Sonja Ristic ◽  
Slavica Kordic ◽  
Ivan Lukovic

A database management system (DBMS) is based on a data model whose concepts are used to express a database schema. Each data model has a specific set of integrity constraint types. There are integrity constraint types, such as key constraint, unique constraint and foreign key constraint that are supported by most DBMSs. Other, more complex constraint types are difficult to express and enforce and are mostly completely disregarded by actual DBMSs. The users have to manage those using custom procedures or triggers. eXtended Markup Language (XML) has become the universal format for representing and exchanging data. Very often XML data are generated from relational databases and exported to a target application or another database. In this context, integrity constraints play the essential role in preserving the original semantics of data. Integrity constraints have been extensively studied in the relational data model. Mechanisms provided by XML schema languages rely on a simple form of constraints that is sufficient neither for expressing semantic constraints commonly found in databases nor for expressing more complex constraints induced by the business rules of the system under study. In this paper we present a classification of constraint types in relational data model, discuss possible declarative mechanisms for their specification and enforcement in the XML data model, and illustrate our approach to the definition and enforcement of complex constraint types in the XML data model on the example of extended tuple constraint type.


2008 ◽  
Author(s):  
S. Niccolini ◽  
S. Tartarelli ◽  
J. Quittek ◽  
T. Dietz ◽  
M. Swany

2014 ◽  
Vol 513-517 ◽  
pp. 1294-1298 ◽  
Author(s):  
Si Si Shen ◽  
Ai Xia Ding

Exchanging and sharing information are the basic request for the Digital Campus. To deal with the current problems of information sharing and integration, the content and framework of the universal data interchange platform are introduced in terms of the categories of processes and the layers of information exchange. And a data interchange model was developed to elaborate the data exchange between different departments on campus. Four key technologies, such as XML data model, XML data hybrid storage, data standard construction and data import & export module are presented so as to define the implementation and exchange paths. The current practice of implement the exchange standards and future study are also discussed.


Author(s):  
Mirjana Mazuran ◽  
Elisa Quintarelli ◽  
Angelo Rauseo ◽  
Letizia Tanca

In this work we describe the TreeRuler tool, which makes it possible for inexperienced users to access huge XML (or relational) datasets. TreeRuler encompasses two main features: (1) it mines all the frequent association rules from input documents without any a-priori specification of the desired results, and (2) it provides quick, summarized, thus often approximate answers to user’s queries, by using the previously mined knowledge. TreeRuler has been developed in the scenario of the Odyssey EU project dealing with information about crimes, both for the relational and XML data model. In this chapter we mainly focus on the objectives, strategies, and difficulties encountered in the XML context.


Sign in / Sign up

Export Citation Format

Share Document