Sciweavers

330 search results - page 1 / 66
» A data abstraction approach for query relaxation
Sort
View
INFSOF
2000
62views more  INFSOF 2000»
13 years 7 months ago
A data abstraction approach for query relaxation
S.-Y. Huh, K.-H. Moon, H. Lee
ER
2010
Springer
164views Database» more  ER 2010»
13 years 5 months ago
Querying Databases with Taxonomies
Traditional information search in which queries are posed against a known and rigid schema over a structured database is shifting towards a Web scenario in which exposed schemas ar...
Davide Martinenghi, Riccardo Torlone
WAIM
2007
Springer
14 years 1 months ago
CoXML: A Cooperative XML Query Answering System
Abstract. The heterogeneity nature of XML data creates the need for approximate query answering. In this paper, we present an XML system that cooperates with users to provide user-...
Shaorong Liu, Wesley W. Chu
AAAI
2008
13 years 9 months ago
Efficient Querying Relaxed Dominant Relationship between Product Items Based on Rank Aggregation
Current search engines cannot effectively rank those relational data, which exists on dynamic websites supported by online databases. In this study, to rank such structured data, ...
Zhenglu Yang, Lin Li, Masaru Kitsuregawa
ICDE
2009
IEEE
156views Database» more  ICDE 2009»
14 years 9 months ago
Distributed Structural Relaxation of XPath Queries
Due to the structural heterogeneity of XML, queries are often interpreted approximately. This is achieved by relaxing the query and ranking the results based on their relevance to ...
Georgia Koloniari, Evaggelia Pitoura