Sciweavers

281 search results - page 27 / 57
» Querying the Guarded Fragment
Sort
View
CORIA
2007
14 years 11 months ago
L'arbre recouvrant dans l'interrogation de documents XML
In this paper, we propose a fuzzy model to querying the XML documents, by taking into account not only the document contents, but also their structure. The concept of minimal size ...
Abdeslame Alilouar
ICCS
2005
Springer
15 years 3 months ago
Scalable Hybrid Search on Distributed Databases
We have previously described a hybrid keyword search that combines metadata search with a traditional keyword search over unstructured context data. This hybrid search paradigm pro...
Jungkee Kim, Geoffrey Fox
INEX
2004
Springer
15 years 3 months ago
If INEX Is the Answer, What Is the Question?
The INEX query languages allow the extraction of fragments from selected documents. This power is not much used in INEX queries. The paper suggests reasons why, and considers which...
Richard A. O'Keefe
WWW
2002
ACM
15 years 11 months ago
Translating XSLT programs to Efficient SQL queries
We present an algorithm for translating XSLT programs into SQL. Our context is that of virtual XML publishing, in which a single XML view is defined from a relational database, an...
Sushant Jain, Ratul Mahajan, Dan Suciu
169
Voted
VLDB
2007
ACM
114views Database» more  VLDB 2007»
15 years 10 months ago
Optimization and evaluation of shortest path queries
We investigate the problem of how to evaluate efficiently a collection of shortest path queries on massive graphs that are too big to fit in the main memory. To evaluate a shortes...
Edward P. F. Chan, Heechul Lim