ACM Home Page
Please provide us with feedback. Feedback
Inferring structure in semistructured data
Full text PdfPdf (461 KB)
Source ACM SIGMOD Record archive
Volume 26 ,  Issue 4  (December 1997) table of contents
Pages: 39 - 43  
Year of Publication: 1997
ISSN:0163-5808
Authors
Svetlozer Nestorov  Department of Computer Science, Stanford University, Stanford, CA
Serge Abiteboul  Department of Computer Science, Stanford University, Stanford, CA
Rajeev Motwani  Department of Computer Science, Stanford University, Stanford, CA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 20,   Citation Count: 14
Additional Information:

abstract   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/271074.271084
What is a DOI?

ABSTRACT

When dealing with semistructured data such as that available on the Web, it becomes important to infer the inherent structure, both for the user (e.g., to facilitate querying) and for the system (e.g., to optimize access). In this paper, we consider the problem of identifying some underlying structure in large collections of semistructured data. Since we expect the data to be fairly irregular, this structure consists of an approximate classification of objects into a hierarchical collection of types. We propose a notion of a type hierarchy for such data, and outline a method for deriving the type hierarchy, and rules for assigning types to data elements.


CITED BY  14

Collaborative Colleagues:
Svetlozer Nestorov: colleagues
Serge Abiteboul: colleagues
Rajeev Motwani: colleagues