An Efficient Unification Algorithm for a Logic Database Language for Nested Relations
|
Descargar SCORM
Este recurso ha sido solicitado 1 veces (0 veces en los últimos 31 días).
Para poder solicitar este recurso debe identificarse como usuario de la biblioteca
|
| |
Ver
Detalles del recurso
|
|
|
An Efficient Unification Algorithm for a Logic Database Language for Nested Relations
|
| Id. |
46698986 |
| Idioma |
inglés
|
| Titulo |
An Efficient Unification Algorithm for a Logic Database Language for Nested Relations |
| Autor(es) |
Yiu-kai Ng
Qing Chang
|
| Localización |
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.50.7655
|
| Versión |
1.0 |
| Estado |
Final
|
| Descripción |
Although efficient unification algorithms exist for logic database queries for flat relations, no efficient unification algorithm has been proposed for logic database queries for nested relations. As a result, the required time to process logic database queries for nested relations is often less than ideal. To overcome this shortcoming, we propose here a linear time unification algorithm for a large class of logic database queries for nested relations. The algorithm provides an efficient evaluation technique for many common nested relational queries. Our paper includes a characterization of the class of nested relational queries that can be handled by our proposed linear time unification algorithm and also the proof of the linearity of the algorithm. Keywords: Logic programming, logic database language, nested relation, unification. 1 Introduction A logic database query can be answered by computing bindings, which are generated by unification. It is therefore important, especially fo...
|
| Tipo |
application/postscript
|
| Palabras clave |
Logic programming
|
| Tipo de recurso |
Texto Narrativo
|
| Tipo de Interactividad |
Expositivo
|
| Nivel de Interactividad |
muy bajo
|
| Audiencia |
Estudiante
Profesor
Autor
|
| Estructura |
Atomic |
| Coste |
no
|
| Copyright |
sí
|
|
Metadata may be used without restrictions as long as the oai identifier remains attached to it. |
| Formatos |
application/postscript
|
| Requerimientos técnicos |
Browser: Any
|
| Relación |
[IsBasedOn] http://lantern.cs.byu.edu/papers/unif.ps
|
| Fecha de contribución |
04-ago-2009 |
| Contacto |
|
|
|
|
|
Valoración de los usuarios
No hay ninguna valoración para este recurso. Sea el primero en
valorar este recurso.
|
|
|
|
