Sciweavers

660 search results - page 2 / 132
» Fuzzy Matching of Web Queries to Structured Data
Sort
View
COOPIS
2004
IEEE
13 years 11 months ago
Supporting Similarity Operations Based on Approximate String Matching on the Web
Querying and integrating sources of structured data from the Web in most cases requires similarity-based concepts to deal with data level conflicts. This is due to the often errone...
Eike Schallehn, Ingolf Geist, Kai-Uwe Sattler
ESWS
2009
Springer
14 years 1 months ago
Ranking Approximate Answers to Semantic Web Queries
We consider the problem of a user querying semistructured data such as RDF without knowing its structure. In these circumstances, it is helpful if the querying system can perform a...
Carlos A. Hurtado, Alexandra Poulovassilis, Peter ...
TKDE
2012
312views Formal Methods» more  TKDE 2012»
11 years 9 months ago
Efficient Fuzzy Type-Ahead Search in XML Data
—In a traditional keyword-search system over XML data, a user composes a keyword query, submits it to the system, and retrieves relevant answers. In the case where the user has l...
Jianhua Feng, Guoliang Li
SEMWEB
2010
Springer
13 years 5 months ago
Combining Approximation and Relaxation in Semantic Web Path Queries
We develop query relaxation techniques for regular path queries and combine them with query approximation in order to support flexible querying of RDF data when the user lacks know...
Alexandra Poulovassilis, Peter T. Wood
SIGMOD
2003
ACM
166views Database» more  SIGMOD 2003»
14 years 7 months ago
Statistical Schema Matching across Web Query Interfaces
Schema matching is a critical problem for integrating heterogeneous information sources. Traditionally, the problem of matching multiple schemas has essentially relied on finding ...
Bin He, Kevin Chen-Chuan Chang