Sciweavers

143 search results - page 16 / 29
» Query Order and the Polynomial Hierarchy
Sort
View
ECWEB
2005
Springer
149views ECommerce» more  ECWEB 2005»
15 years 2 months ago
Architecture of a Semantic XPath Processor. Application to Digital Rights Management
This work describes a novel strategy for designing an XPath processor that acts over an RDF mapping of XML. We use a modelmapping approach to represent instances of XML and XML Sch...
Rubén Tous, Roberto García, Eva Rodr...
ENTCS
2006
144views more  ENTCS 2006»
14 years 9 months ago
Contorsion: A Semantic XPath Processor
This work describes the architecture of Contorsion, a semantic XPath processor that acts over an RDF mapping of XML. It contributes to a recent research trend that defines an XML-...
Rubén Tous, Jaime Delgado
EFDBS
2001
14 years 10 months ago
Augmenting SQL with Dynamic Restructuring to Support Interoperability in a Relational Federation
In this work, we consider augmenting SQL with constructs allowing dynamic restructuring. Dynamic restructuring occurs naturally in a framework including second-order capabilities f...
Catharine M. Wyss, Felix I. Wyss, Dirk Van Gucht
ICALP
2005
Springer
15 years 2 months ago
The Tree Inclusion Problem: In Optimal Space and Faster
Given two rooted, ordered, and labeled trees P and T the tree inclusion problem is to determine if P can be obtained from T by deleting nodes in T. This problem has recently been r...
Philip Bille, Inge Li Gørtz
PAMI
2008
152views more  PAMI 2008»
14 years 9 months ago
K-Nearest Neighbor Finding Using MaxNearestDist
Abstract-Similarity searching often reduces to finding the k nearest neighbors to a query object. Finding the k nearest neighbors is achieved by applying either a depth-first or a ...
Hanan Samet