Access the full text.
Sign up today, get DeepDyve free for 14 days.
C. Bolchini, C. Curino, G. Orsi, E. Quintarelli, R. Rossato, F. Schreiber, L. Tanca (2009)
And what can context do for data?Communications of the ACM, 52
Wolf-Tilo Balke, M. Wagner (2004)
Through different eyes: assessing multiple conceptual views for querying web services
E. Codd (1972)
Relational Completeness of Data Base SublanguagesResearch Report / RJ / IBM / San Jose, California, RJ987
R. Agrawal, E. Wimmers (2000)
A framework for expressing and combining preferences
Chengfei Liu, Jianxin Li, J. Yu, Rui Zhou (2010)
Adaptive relaxation for querying heterogeneous XML data sourcesInf. Syst., 35
D. Martinenghi, Riccardo Torlone (2010)
Querying Databases with Taxonomies
A. Broder, M. Fontoura, V. Josifovski, Lance Riedel (2007)
A semantic approach to contextual advertising
Y. Kanza, Y. Sagiv (2001)
Flexible queries over semistructured data
Yunyao Li, Huahai Yang, H. Jagadish (2007)
NaLIX: A generic natural language search environment for XML dataACM Trans. Database Syst., 32
Ronald Fagin, R. Guha, Ravi Kumar, Jasmine Novak, D. Sivakumar, A. Tomkins (2005)
Multi-structural databases
T. Gaasterland, P. Godfrey, J. Minker (1992)
Relaxation as a platform for cooperative answeringJournal of Intelligent Information Systems, 1
Yen-Yu Chen, Torsten Suel, Alexander Markowetz (2006)
Efficient query processing in geographic web search enginesProceedings of the 2006 ACM SIGMOD international conference on Management of data
(2011)
and E
D. Martinenghi, M. Tagliasacchi (2012)
Proximity measures for rank joinACM Transactions on Database Systems (TODS), 37
Jagdev Bhogal, A. MacFarlane, Peter Smith (2007)
A review of ontology based query expansionInf. Process. Manag., 43
X. Dong
Schemas : A Preliminary Report
S. Abiteboul, C. Beeri (1995)
The power of languages for the manipulation of complex valuesThe VLDB Journal, 4
J. Chomicki (2003)
Preference formulas in relational queriesACM Trans. Database Syst., 28
S. Amer-Yahia, L. Lakshmanan, Shashank Pandit (2004)
FleXPath: flexible structure and full-text querying for XML
Martha Escobar-Molano, R. Hull, D. Jacobs (1993)
Safety and translation of calculus queries with scalar functions
Carlos Hurtado, A. Poulovassilis, P. Wood (2008)
Query Relaxation in RDFJ. Data Semant., 10
A. Bernstein, Christoph Kiefer (2006)
Imprecise RDQL: towards generic retrieval in ontologies using similarity joinsProceedings of the 2006 ACM symposium on Applied computing
E. Rahm, P. Bernstein (2001)
A survey of approaches to automatic schema matchingThe VLDB Journal, 10
Ronald Fagin, Phokion Kolaitis, Ravi Kumar, Jasmine Novak, D. Sivakumar, A. Tomkins (2005)
Efficient Implementation of Large-Scale Multi-Structural Databases
G. Koutrika, Y. Ioannidis (2004)
Personalization of queries in database systemsProceedings. 20th International Conference on Data Engineering
Shady Elbassuoni, Maya Ramanath, Ralf Schenkel, G. Weikum (2010)
Searching RDF Graphs with SPARQL and KeywordsIEEE Data Eng. Bull., 33
Ilio Catallo, Eleonora Ciceri, P. Fraternali, D. Martinenghi, M. Tagliasacchi (2013)
Top-k diversity queries over bounded regionsACM Trans. Database Syst., 38
Xuan Zhou, Julien Gaugaz, Wolf-Tilo Balke, W. Nejdl (2007)
Query relaxation using malleable schemas
Xiangfu Meng (2009)
MADRID ! Track : XML and Web Data / Session : XML Querying 1022
T. Andreasen, H. Bulskov (2009)
Conceptual querying through ontologiesFuzzy Sets Syst., 160
S. Amer-Yahia, Emiran Curtmola, Alin Deutsch (2006)
Flexible and efficient XML search with complex full-text predicatesProceedings of the 2006 ACM SIGMOD international conference on Management of data
Shady Elbassuoni, Maya Ramanath, G. Weikum (2011)
Query Relaxation for Entity-Relationship Search
Anastasios Arvanitis, G. Koutrika (2012)
PrefDB: bringing preferences closer to the DBMSProceedings of the 2012 ACM SIGMOD International Conference on Management of Data
H. Bulskov, R. Knappe, T. Andreasen (2004)
On Querying Ontologies and Databases
Peter Dolog, H. Stuckenschmidt, H. Wache, J. Diederich (2009)
Relaxing RDF queries based on user and domain preferencesJournal of Intelligent Information Systems, 33
I. Ilyas, G. Beskales, Mohamed Soliman (2008)
A survey of top-k query processing techniques in relational database systemsACM Comput. Surv., 40
Zohra Bellahsene, A. Bonifati, E. Rahm (2013)
Schema Matching and Mapping
P. Ciaccia, Riccardo Torlone (2011)
Modeling the Propagation of User Preferences
M. Fontoura, V. Josifovski, Ravi Kumar, Christopher Olston, A. Tomkins, Sergei Vassilvitskii (2008)
Relaxation in text search using taxonomiesProc. VLDB Endow., 1
Nick Koudas, Chen Li, A. Tung, R. Vernica (2006)
Relaxing join and selection queries
K. Stefanidis, G. Koutrika, E. Pitoura (2011)
A survey on representation, composition and application of preferences in database systemsACM Trans. Database Syst., 36
Diego Calvanese, Giuseppe Giacomo, D. Lembo, M. Lenzerini, Antonella Poggi, M. Rodriguez-Muro, R. Rosati, M. Ruzzi, Domenico Savo (2011)
The MASTRO system for ontology-based data accessSemantic Web, 2
Werner Kießling (2002)
Foundations of Preferences in Database Systems
Traditional information search in which queries are posed against a known and rigid schema over a structured database is shifting toward a Web scenario in which exposed schemas are vague or absent and data come from heterogeneous sources. In this framework, query answering cannot be precise and needs to be relaxed, with the goal of matching user requests with accessible data. In this paper, we propose a logical model and a class of abstract query languages as a foundation for querying relational data sets with vague schemas. Our approach relies on the availability of taxonomies, that is, simple classifications of terms arranged in a hierarchical structure. The model is a natural extension of the relational model in which data domains are organized in hierarchies, according to different levels of generalization between terms. We first propose a conservative extension of the relational algebra for this model in which special operators allow the specification of relaxed queries over vaguely structured information. We also study equivalence and rewriting properties of the algebra that can be used for query optimization. We then illustrate a logic-based query language that can provide a basis for expressing relaxed queries in a declarative way. We finally investigate the expressive power of the proposed query languages and the independence of the taxonomy in this context.
The VLDB Journal – Springer Journals
Published: Oct 1, 2014
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.