Processing of Concept Based Queries for XML Data

In the last years, semistructured data has played an increasing role within the database community. Many query languages have been developed for querying semistructured data and in particular XML data sources. The languages usually are navigational and therefore require the user to know the details of the database structure. This paper introduces concept based queries (CBQs)as a means to retrieve instances based on concept names; concepts basically are complex types in an XML schema. CBQs exploit generalization relationships available between concepts. As a consequence, concept based queries free users from knowing some of the details about the structure in XML documents and hence ease querying of semi structured data.

[1]  Jürgen Ebert,et al.  GraX-an interchange format for reengineering tools , 1999, Sixth Working Conference on Reverse Engineering (Cat. No.PR00303).

[2]  Gottfried Vossen,et al.  An Extension of Path Expressions to Simplify Navigation in Object-Oriented Queries , 1993, DOOD.

[3]  Edward Sciore,et al.  A Universal Relation Data Model with Semantic Abstraction , 1992, IEEE Trans. Knowl. Data Eng..

[4]  Jürgen Dix,et al.  Transformation-based bottom-up computation of the well-founded model , 1996, Theory and Practice of Logic Programming.

[5]  Oliver Obst,et al.  Towards a Logical Approach for Soccer Agents Engineering , 2000, RoboCup.

[6]  Yehoshua Sagiv,et al.  Flexible queries over semistructured data , 2001, PODS '01.

[7]  Norbert Eisinger,et al.  A Confluent Connection Calculus , 2000, Intellectics and Computational Logic.

[8]  Roy Goldman,et al.  DataGuides: Enabling Query Formulation and Optimization in Semistructured Databases , 1997, VLDB.

[9]  Victor W. Marek,et al.  The Logic Programming Paradigm , 1999, Artificial Intelligence.

[10]  Volker Riediger,et al.  Folding: an approach to enable program understanding of preprocessed languages , 2001, Proceedings Eighth Working Conference on Reverse Engineering.

[11]  Frieder Stolzenburg,et al.  Loop-Detection in Hyper-Tableaux by Powerful Model Generation , 1999, J. Univers. Comput. Sci..

[12]  Jürgen Ebert,et al.  A Formalization of SOCCA , 1999 .

[13]  Jens Woch,et al.  Implementation of a Schema-TAG-Parser , 1999 .

[14]  Alberto O. Mendelzon,et al.  Finding Regular Simple Paths in Graph Databases , 1989, SIAM J. Comput..

[15]  Jürgen Dix,et al.  Super logic programs , 2000, TOCL.

[16]  Ulrich Furbach,et al.  Nonmonotonic Reasoning: Towards Efficient Calculi and Implementations , 2001, Handbook of Automated Reasoning.

[17]  Oliver Obst,et al.  Spatial Agents Implemented in a Logical Expressible Language , 1999, RoboCup.

[18]  Serge Abiteboul,et al.  Regular path queries with constraints , 1997, PODS '97.

[19]  Andreas Winter,et al.  Querying as an enabling technology in software reengineering , 1999, Proceedings of the Third European Conference on Software Maintenance and Reengineering (Cat. No. PR00090).

[20]  Tom Atwood,et al.  Object Database Standard: ODMG-93, Release 1.2 , 1995 .

[21]  Guillermo R. Simari,et al.  lntroducing generalized specificity in logic programming , 2000 .

[22]  Serge Abiteboul,et al.  From structured documents to novel query facilities , 1994, SIGMOD '94.

[23]  Andreas Winter,et al.  Towards a Common Query Language for Reverse Engineering , 2002 .

[24]  Andreas Winter,et al.  Exchanging Graphs with GXL , 2001, GD.

[25]  Jan Murray.  Specifying agents with UML in robotic soccer , 2002, AAMAS '02.

[26]  Michael Schrefl,et al.  Dynamic Derivation of Personalized Views , 1988, VLDB.

[27]  Dan Suciu,et al.  Adding Structure to Unstructured Data , 1997, ICDT.

[28]  Jennifer Widom,et al.  The Lorel query language for semistructured data , 1997, International Journal on Digital Libraries.

[29]  Andy Schürr,et al.  GXL: toward a standard exchange format , 2000, Proceedings Seventh Working Conference on Reverse Engineering.

[30]  Kurt Lautenbach,et al.  Reproducibility of the Empty Marking , 2002, ICATPN.

[31]  Oliver Obst,et al.  Qualitative Velocity and Ball Interception , 2002, KI.

[32]  Stephan Philippi,et al.  Modelling a concurrent ray-tracing algorithm using object-oriented Petri-Nets , 2001 .

[33]  Peter Baumgartner,et al.  The Taming of the (X)OR , 2000, Computational Logic.

[34]  Jürgen Dix,et al.  Relating defeasible and normal logic programming through transformation properties , 2000, Theor. Comput. Sci..

[35]  Manfred Rosendahl,et al.  Specification of Symbols and Implementation of Their Constraints in JKogge , 2000 .

[36]  Peter Baumgartner,et al.  Automated Deduction Techniques for the Management of Personalized Documents , 2003, Annals of Mathematics and Artificial Intelligence.

[37]  Peter Baumgartner,et al.  First-order logic Davis-Putnam-Logemann-Loveland procedure , 2003 .

[38]  Joseph Douglas Horton,et al.  Merge Path Improvements for Minimal Model Hyper Tableaux , 1999, TABLEAUX.

[39]  Diane C. P. Smith,et al.  Database abstractions: aggregation and generalization , 1977, TODS.

[40]  Oliver Obst.  Specifying Rational Agents with Statecharts and Utility Functions , 2001, RoboCup.

[41]  Jennifer Widom,et al.  Object exchange across heterogeneous information sources , 1995, Proceedings of the Eleventh International Conference on Data Engineering.

[42]  Michael Kifer,et al.  Querying object-oriented databases , 1992, SIGMOD '92.

[43]  Toshiaki Arai,et al.  Multiagent systems specification by UML statecharts aiming at intelligent manufacturing , 2002, AAMAS '02.

[44]  Peter Baumgartner,et al.  Abductive Coreference by Model Construction , 1999 .