CoBase: a scalable and extensible cooperative information system
Journal of Intelligent Information Systems - Special issue on intelligent integration of information
Authoritative sources in a hyperlinked environment
Journal of the ACM (JACM)
A language modeling approach to information retrieval
A language modeling approach to information retrieval
A vector space model for automatic indexing
Communications of the ACM
Reconciling schemas of disparate data sources: a machine-learning approach
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
XIRQL: a query language for information retrieval in XML documents
Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval
Learning to map between ontologies on the semantic web
Proceedings of the 11th international conference on World Wide Web
Mining database structure; or, how to build a data quality browser
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
A survey of approaches to automatic schema matching
The VLDB Journal — The International Journal on Very Large Data Bases
Searching XML documents via XML fragments
Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval
Statistical schema matching across web query interfaces
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Query relaxation for xml model
Query relaxation for xml model
FleXPath: flexible structure and full-text querying for XML
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Through different eyes: assessing multiple conceptual views for querying web services
Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters
Towards the next generation of enterprise search technology
IBM Systems Journal
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Schema Matching Using Duplicates
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Relaxing join and selection queries
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Duplicate Record Detection: A Survey
IEEE Transactions on Knowledge and Data Engineering
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Relaxation in text search using taxonomies
Proceedings of the VLDB Endowment
Output perturbation with query relaxation
Proceedings of the VLDB Endowment
Wildcards for lightweight information integration in virtual desktops
Proceedings of the 17th ACM conference on Information and knowledge management
Flexible query answering on graph-modeled data
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Language-model-based ranking for queries on RDF-graphs
Proceedings of the 18th ACM conference on Information and knowledge management
Adaptive relaxation for querying heterogeneous XML data sources
Information Systems
Query ranking in information integration
CAiSE'10 Proceedings of the 22nd international conference on Advanced information systems engineering
Querying databases with taxonomies
ER'10 Proceedings of the 29th international conference on Conceptual modeling
FACTO: a fact lookup engine based on web tables
Proceedings of the 20th international conference on World wide web
Schema-as-you-go: on probabilistic tagging and querying of wide tables
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Query relaxation for entity-relationship search
ESWC'11 Proceedings of the 8th extended semantic web conference on The semanic web: research and applications - Volume Part II
What Makes a Phone a Business Phone - Querying Concepts in Product Data
WI-IAT '11 Proceedings of the 2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology - Volume 01
Topological operators: a relaxed query processing approach
Geoinformatica
Conceptual views for entity-centric search: turning data into meaningful concepts
Computer Science - Research and Development
Pushing the boundaries of crowd-enabled databases with query-driven schema expansion
Proceedings of the VLDB Endowment
ReAction: personalized minimal repair adaptations for customer requests
FQAS'11 Proceedings of the 9th international conference on Flexible Query Answering Systems
Heterogeneous web data search using relevance-based on the fly data integration
Proceedings of the 21st international conference on World Wide Web
Aligning freebase with the YAGO ontology
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Querying concepts in product data by means of query expansion
Web Intelligence and Agent Systems
Hi-index | 0.00 |
In contrast to classical databases and IR systems, real-world information systems have to deal increasingly with very vague and diverse structures for information management and storage that cannot be adequately handled yet. While current object-relational database systems require clear and unified data schemas, IR systems usually ignore the structured information completely. Malleable schemas, as recently introduced, provide a novel way to deal with vagueness, ambiguity and diversity by incorporating imprecise and overlapping definitions of data structures. In this paper, we propose a novel query relaxation scheme that enables users to find best matching information by exploiting malleable schemas to effectively query vaguely structured information. Our scheme utilizes duplicates in differently described data sets to discover the correlations within a malleable schema, and then uses these correlations to appropriately relax the users' queries. In addition, it ranks results of the relaxed query according to their respective probability of satisfying the original query's intent. We have implemented the scheme and conducted extensive experiments with real-world data to confirm its performance and practicality.