Query relaxation using malleable schemas Export

@inproceedings{citeulike:1419648, abstract = {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.}, address = {New York, NY, USA}, author = {Zhou, Xuan and Gaugaz, Julien and Balke, Wolf T. and Nejdl, Wolfgang}, booktitle = {SIGMOD '07: Proceedings of the 2007 ACM SIGMOD international conference on Management of data}, citeulike-article-id = {1419648}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=1247480.1247541}, citeulike-linkout-1 = {http://dx.doi.org/10.1145/1247480.1247541}, doi = {10.1145/1247480.1247541}, isbn = {978-1-59593-686-8}, keywords = {db}, location = {Beijing, China}, pages = {545--556}, posted-at = {2009-01-27 10:21:21}, priority = {2}, publisher = {ACM}, title = {Query relaxation using malleable schemas}, url = {http://dx.doi.org/10.1145/1247480.1247541}, year = {2007} }

TY - CONF ID - citeulike:1419648 L3 - citeulike-article-id:1419648 N2 - 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. CY - Beijing, China SN - 978-1-59593-686-8 AD - New York, NY, USA EP - 556 TI - Query relaxation using malleable schemas PB - ACM T2 - SIGMOD '07: Proceedings of the 2007 ACM SIGMOD international conference on Management of data SP - 545 KW - db AU - Zhou, Xuan AU - Gaugaz, Julien AU - Balke, Wolf AU - Nejdl, Wolfgang PY - 2007/// UR - http://dx.doi.org/10.1145/1247480.1247541 ER -