Details
| Original language | English |
|---|---|
| Title of host publication | SIGMOD 2007 |
| Subtitle of host publication | Proceedings of the ACM SIGMOD International Conference on Management of Data |
| Publisher | Association for Computing Machinery (ACM) |
| Pages | 545-556 |
| Number of pages | 12 |
| ISBN (print) | 1595936866, 9781595936868 |
| Publication status | Published - 11 Jun 2007 |
| Event | SIGMOD 2007: ACM SIGMOD International Conference on Management of Data - Beijing, China Duration: 12 Jun 2007 → 14 Jun 2007 |
Publication series
| Name | Proceedings of the ACM SIGMOD International Conference on Management of Data |
|---|---|
| ISSN (Print) | 0730-8078 |
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.
Keywords
- Malleable schema, Query relaxation
ASJC Scopus subject areas
- Computer Science(all)
- Software
- Computer Science(all)
- Information Systems
Cite this
- Standard
- Harvard
- Apa
- Vancouver
- BibTeX
- RIS
SIGMOD 2007: Proceedings of the ACM SIGMOD International Conference on Management of Data. Association for Computing Machinery (ACM), 2007. p. 545-556 (Proceedings of the ACM SIGMOD International Conference on Management of Data).
Research output: Chapter in book/report/conference proceeding › Conference contribution › Research › peer review
}
TY - GEN
T1 - Query relaxation using malleable schemas
AU - Zhou, Xuan
AU - Gaugaz, Julien
AU - Balke, Wolf Tilo
AU - Nejdl, Wolfgang
PY - 2007/6/11
Y1 - 2007/6/11
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.
AB - 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.
KW - Malleable schema
KW - Query relaxation
UR - http://www.scopus.com/inward/record.url?scp=35448995724&partnerID=8YFLogxK
U2 - 10.1145/1247480.1247541
DO - 10.1145/1247480.1247541
M3 - Conference contribution
AN - SCOPUS:35448995724
SN - 1595936866
SN - 9781595936868
T3 - Proceedings of the ACM SIGMOD International Conference on Management of Data
SP - 545
EP - 556
BT - SIGMOD 2007
PB - Association for Computing Machinery (ACM)
T2 - SIGMOD 2007: ACM SIGMOD International Conference on Management of Data
Y2 - 12 June 2007 through 14 June 2007
ER -