Concept based querying of semistructured 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. XML data often is described by means of DTDs and more recently through XML schemas. This paper is about querying semistructured data by making use of the schema and the types described therein. Elements of an XML documents are considered as instances of schema concepts. Concept based queries provide a means to retrieve instances based on concept names and in particular offer a possibility to exploit generalization relationships between concepts. As a consequence, concept based queries free users from knowing the details about the structure in XML documents and hence ease querying of semi structured data.

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

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

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

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

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

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

[7]  Bernt Kullbach.  Bericht über den 2. Workshop Software-Reengineering (WSR 2000) am 11. und 12. Mai 2000 in Bad Honnef , 2000, Softwaretechnik-Trends.

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

[9]  Jürgen Dix,et al.  Meta-agent programs , 2000, J. Log. Program..

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

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

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

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

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

[15]  Manfred Kamp.  Managing a multi-file, multi-language software repository for program comprehension tools: a generic approach , 1998, Proceedings. 6th International Workshop on Program Comprehension. IWPC'98 (Cat. No.98TB100242).

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

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

[18]  Alin Deutsch,et al.  Querying XML Data , 1999, IEEE Data Eng. Bull..

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

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

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

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

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

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

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

[26]  Ulrich Furbach,et al.  Disjunctive Logic Program = Horn Program + Control Program , 1998, JELIA.

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

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

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

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

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

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

[33]  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).

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

[35]  Pedro José Marrón,et al.  On Processing XML in LDAP , 2001, VLDB.

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

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

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

[39]  Jürgen Ebert,et al.  Program comprehension in multi-language systems , 1998, Proceedings Fifth Working Conference on Reverse Engineering (Cat. No.98TB100261).

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

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

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

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