Sciweavers

1846 search results - page 142 / 370
» Generating query substitutions
Sort
View
TCOS
2010
13 years 6 months ago
Approximate Shortest Path Queries Using Voronoi Duals
We propose an approximation method to answer point-to-point shortest path queries in undirected edge-weighted graphs, based on random sampling and Voronoi duals. We compute a simp...
Shinichi Honiden, Michael E. Houle, Christian Somm...
ECAI
2004
Springer
14 years 1 months ago
SPortS: Semantic + Portal + Service
Ontology-based web portal generation and management is an active field of research and development. Recently, many systems have been developed. However, many of them lack the inte...
Chenxi Lin, Lei Zhang, Jian Zhou, Yin Yang, Yong Y...
VLDB
2007
ACM
107views Database» more  VLDB 2007»
14 years 8 months ago
VGRAM: Improving Performance of Approximate Queries on String Collections Using Variable-Length Grams
Many applications need to solve the following problem of approximate string matching: from a collection of strings, how to find those similar to a given string, or the strings in ...
Chen Li, Bin Wang, Xiaochun Yang
SEMWEB
2009
Springer
14 years 2 months ago
XLWrap - Querying and Integrating Arbitrary Spreadsheets with SPARQL
In this paper a novel approach is presented for generating RDF graphs of arbitrary complexity from various spreadsheet layouts. Currently, none of the available spreadsheet-to-RDF ...
Andreas Langegger, Wolfram Wöß
IDEAS
2005
IEEE
137views Database» more  IDEAS 2005»
14 years 1 months ago
Order-Sensitive XML Query Processing over Relational Sources: An Algebraic Approach
The XML data is order-sensitive. The order problem, that is how ordered XML documents and order-sensitive queries over it can be efficiently supported when mapped into the unorde...
Ling Wang, Song Wang, Brian Murphy, Elke A. Runden...