Presentation	1999/7/22 Query Language Constructs for Uncertain Query Patterns in Semistructured Data KEISHI TAJIMA,
PDF Download Page	PDF download Page Link
Abstract(in Japanese)	(See Japanese page)
Abstract(in English)	Two main difficulties in specifying queries on semistructured data are structural heterogeneity of the data, and the lack of the schema in advance. In the languages proposed in past, wild cards are used to solve these problems. When we specify queries without the knowledge of the entire data structure, however, wild cards often match with unexpected data, and it causes noises in query answers. To solve this problem, we introduce constructs for specifying query patterns with order of likelihood to match with appropriate data. In this paper, we design three constructs, a case construct, a construct for smallest matching, and a construct for minimal matching. By using those constructs, we can specify queries returning only really expected answers more easily and with less knowledge on the entire data structure.
Keyword(in Japanese)	(See Japanese page)
Keyword(in English)
Paper #	DE99-48
Date of Issue

Conference Information
Committee	DE
Conference Date	1999/7/22(1days)
Place (in Japanese)	(See Japanese page)
Place (in English)
Topics (in Japanese)	(See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To	Data Engineering (DE)
Language	ENG
Title (in Japanese)	(See Japanese page)
Sub Title (in Japanese)	(See Japanese page)
Title (in English)	Query Language Constructs for Uncertain Query Patterns in Semistructured Data
Sub Title (in English)
Keyword(1)
1st Author's Name	KEISHI TAJIMA
1st Author's Affiliation	Dept. of Comp. and Sys. Eng., Kobe University()
Date	1999/7/22
Paper #	DE99-48
Volume (vol)	vol.99
Number (no)	202
Page	pp.pp.-
#Pages	6
Date of Issue