(Enter summary)
Abstract: The emerging field of semistructured data leads to new ways of representing
data as 'schemaless' or 'self-describing'. However, in many
applications data has often some regularity and ignoring the (possibly
partial) structure hinders the abilities to interpret the data and to access
them efficiently. In this paper we investigate a knowledge-based approach
for discovering (partial) implicit structures from semistructured data. We
show that semistructured data, represented in the form of... (Update)
Active bibliography (related documents): More All
0.5: Making Interoperation Tractable - Sergey Melnik Stanford
(Correct)
0.5: Database Techniques for the World-Wide Web: A Survey - Florescu, Levy, Mendelzon (1998)
(Correct)
0.0: TBoxes do not yield a compact representation of least common.. - Baader, Turhan (2001)
(Correct)
Similar documents based on text: More All
0.4: Computing Concept Covers: A Preliminary Report - Hacid, Leger, Rey, Toumani (2002)
(Correct)
0.3: A Hierarchical Access Control Model for - Video Database Systems (2003)
(Correct)
0.2: A Database Approach for Modeling and Querying Video Data - Decleir, Hacid (1999)
(Correct)
BibTeX entry: (Update)
@inproceedings{ hacid00schema,
author = "Mohand-Said Hacid and F. Soualmia and Farouk Toumani",
title = "Schema Extraction for Semi-Structured Data",
booktitle = "Description Logics",
pages = "133-142",
year = "2000",
url = "citeseer.ist.psu.edu/690912.html" }
Citations (may not include all citations):
373
Querying semi-structured data
- Abiteboul - 1997
208
Data on the Web : From Relations to Semistructured Data and .. (context) - Abiteboul, Buneman et al. - 2000
193
Reasoning and Revision in Hybrid Representation Systems (context) - Nebel - 1990
156
Adding structure to unstructured data
- Buneman, Davidson et al. - 1997
143
Storing Semistructured Data with STORED
- Deutsch, Fernandez et al. - 1999
50
Computing Least Common Subsumer in Description Logics with E..
- Baader, Kusters et al. - 1999
50
Reasoning with Individuals in Concept Languages
- Schaerf - 1994
34
Deduction in concept languages: From subsumption to instance..
- Donini, Lenzerini et al. - 1994
27
Computing the least common subsumer and the most specific co..
- Baader, Kusters - 1998
25
Type inference for queries on semistructured data (context) - Suciu, Milo - 1999
2
Object exchange across heterogeneous information sources (context) - Widom, Papakonstantinou et al. - 1995
2
Extracting schema from semistructured data (context) - Motwani, Nestorov et al. - 1998
1
Substructures discovery from semistructured data (context) - Hacid, Soualmia et al. - 2000
1
Most Specific Concepts Technique for Knowledge Bases with In.. (context) - Donini, Era - 1992
Documents on the same site (http://SunSITE.Informatik.RWTH-Aachen.de/Publications/CEUR-WS//Vol-33/index.html): More
A DL to describe classes of queries and mapping.. - Bermúdez..
(Correct)
Rewriting Conjunctive Queries Using Views in Description.. - Goasdoue, Rousset (2000)
(Correct)
Mary Likes all Cats - Lutz, Sattler (2000)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC