WEKO3
-
RootNode
アイテム
An Algorithm for Finding top-K Valid XPath Queries
https://ipsj.ixsq.nii.ac.jp/records/101910
https://ipsj.ixsq.nii.ac.jp/records/1019100eb5a238-92bc-43c6-bbf0-9fa3cc4f3f8b
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
IPSJ-TOD0702008.pdf (980.5 kB)
|
Copyright (c) 2014 by the Information Processing Society of Japan
|
|
| オープンアクセス | ||
| Item type | Trans(1) | |||||||
|---|---|---|---|---|---|---|---|---|
| 公開日 | 2014-06-30 | |||||||
| タイトル | ||||||||
| タイトル | An Algorithm for Finding top-K Valid XPath Queries | |||||||
| タイトル | ||||||||
| 言語 | en | |||||||
| タイトル | An Algorithm for Finding top-K Valid XPath Queries | |||||||
| 言語 | ||||||||
| 言語 | eng | |||||||
| キーワード | ||||||||
| 主題Scheme | Other | |||||||
| 主題 | [研究論文] XPath, DTD, XML | |||||||
| 資源タイプ | ||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||
| 資源タイプ | journal article | |||||||
| 著者所属 | ||||||||
| University of Tsukuba | ||||||||
| 著者所属 | ||||||||
| University of Tsukuba | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| University of Tsukuba | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| University of Tsukuba | ||||||||
| 著者名 |
Kosetsu, Ikeda
× Kosetsu, Ikeda
|
|||||||
| 著者名(英) |
Kosetsu, Ikeda
× Kosetsu, Ikeda
|
|||||||
| 論文抄録 | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | Suppose that we have a DTD and XML documents valid against the DTD, and consider writing an XPath query to the documents. Unfortunately, a user often does not understand the entire structure of the documents exactly, especially in the case where the documents are very large and/or complex, or the DTD has been updated but the user misses it. In such cases, the user tends to write an invalid XPath query. However, it is difficult for the user to correct the query by hand due to his/her lack of exact knowledge about the entire structure of the documents. In this paper, we propose an algorithm that finds, for an XPath query q, a DTD D, and a positive integer K, top-K XPath queries most syntactically close to q among the XPath queries conforming to D, so that a user select an appropriate query among the K queries. We also present some experimental studies. | |||||||
| 論文抄録(英) | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | Suppose that we have a DTD and XML documents valid against the DTD, and consider writing an XPath query to the documents. Unfortunately, a user often does not understand the entire structure of the documents exactly, especially in the case where the documents are very large and/or complex, or the DTD has been updated but the user misses it. In such cases, the user tends to write an invalid XPath query. However, it is difficult for the user to correct the query by hand due to his/her lack of exact knowledge about the entire structure of the documents. In this paper, we propose an algorithm that finds, for an XPath query q, a DTD D, and a positive integer K, top-K XPath queries most syntactically close to q among the XPath queries conforming to D, so that a user select an appropriate query among the K queries. We also present some experimental studies. | |||||||
| 書誌レコードID | ||||||||
| 収録物識別子タイプ | NCID | |||||||
| 収録物識別子 | AA11464847 | |||||||
| 書誌情報 |
情報処理学会論文誌データベース（TOD） 巻 7, 号 2, p. 70-82, 発行日 2014-06-30 |
|||||||
| ISSN | ||||||||
| 収録物識別子タイプ | ISSN | |||||||
| 収録物識別子 | 1882-7799 | |||||||
| 出版者 | ||||||||
| 言語 | ja | |||||||
| 出版者 | 情報処理学会 | |||||||
