![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
Toward Approximate GML Search and Retrieval
| Joe TEKLI | Richard CHBEIR | Fernando FERRI & Patrizia GRIFONI | ||
| SOE, Dept. of Electrical & Computer Eng. Lebanese American University 36 Byblos, LEBANON |
UPPA Laboratory, IUT of Bayonne University of Pau and Adour Countries 64600 Anglet, FRANCE |
IRPPS-CNR |
||
| joe.tekli@lau.edu.lb www.lau.edu.lb |
richard.chbeir@univ-pau.fr www.univ-pau.fr |
{fernando.ferri, patrizia.grifoni} @ irpps.cnr.it http://www.irpps.cnr.it/ |
Abstract
The amount of geographic data on the Internet is becoming huge and widely accessible to users who are generally non-computer scientists. On one hand, users usually search data without a deep knowledge of the spatial domain at hand, thus formulating queries resulting in a reduction of result quality. In this context, techniques for approximate and ranked querying become crucial. Such techniques require, in one way or another, the evaluation of query/data similarity. On the other hand, GML [1] is emerging as the new standard for representing geographic information. Following GML, a geographic entity consists of a hierarchically structured self describing piece of geographic information, incorporating structurally and semantically rich data in one entity.
In this study, we address the problem of approximate and ranked querying for GML data, and proposed a method for GML query evaluation [2]. Our method consists of two main contributions. First, we propose a tree model for representing GML queries and data collections. Then, we provide a GML retrieval framework based on the concept of tree edit distance [3, 4] as an efficient means for comparing rigorously structured data . Our method allows the evaluation of both structural [5] and semantic similarities [6, 7] in GML data, enabling the user to tune the querying process according to her needs. The user can also choose to perform either template or minimum constraint querying. Following the latter strategy, only elements required by the query tree are taken into account in similarity evaluation. Preliminary experimental tests are promising.
References