Home   >   CSC-OpenAccess Library   >    Manuscript Information
Full Text Available

(195.48KB)
This is an Open Access publication published under CSC-OpenAccess Policy.
Publications from CSC-OpenAccess Library are being accessed from over 74 countries worldwide.
Towards a Query Rewriting Algorithm Over Proteomics XML Resources
Kunale Kudagba, Hassan Badir, Omar Ei Beqqali
Pages - 48 - 58     |    Revised - 30-09-2009     |    Published - 21-10-2009
Volume - 3   Issue - 4    |    Publication Date - August 2009  Table of Contents
MORE INFORMATION
KEYWORDS
Proteomics, Query Rewriting, minimal Transversals, Semantic Web, XML, Ontology
ABSTRACT
Querying and sharing Web proteomics data is not an easy task. Given that, several data sources can be used to answer the same sub-goals in the Global query, it is obvious that we can have many candidates rewritings. The user-query is formulated using Concepts and Properties related to Proteomics research (Domain Ontology). Semantic mappings describe the contents of underlying sources. In this paper, we propose a characterization of query rewriting problem using semantic mappings as an associated hypergraph. Hence, the generation of candidates’ rewritings can be formulated as the discovery of minimal Transversals of an hypergraph. We exploit and adapt algorithms available in Hypergraph Theory to find all candidates rewritings from a query answering problem. Then, in future work, some relevant criteria could help to determine optimal and qualitative rewritings, according to user needs, and sources performances.
1 Google Scholar 
2 ScientificCommons 
3 Academic Index 
4 CiteSeerX 
5 refSeek 
6 iSEEK 
7 Socol@r  
8 ResearchGATE 
9 Bielefeld Academic Search Engine (BASE) 
10 Scribd 
11 WorldCat 
12 SlideShare 
13 PDFCAST 
14 PdfSR 
1 B. Amann, C. Beeri, I. Fundulaki, and M. Scholl, “Ontology-based integration of XML web resources”. In Proceedings of International Semantic Web Conference '02, pp. 117-131, 2002
2 F. Baader, D. Calvanese, D. McGuinness, E.D. Nardi, and P. Patel-Schneider, “The Description Logic Handbook, Theory, Implementation and Applications”, Cambridge University Press, Cambridge, (2003).
3 Benatallah, B., Hacid M-S., Paik H-y., Rey C., Toumani F., 2006. Towards semantic-driven, flexible and scalable framework for peering and querying e-catalog communities, In Elsevier’s Journal of Information Systems, Pages: 266-294.
4 Berge, C., 1989. Hypergraphs. North Holland, Amsterdam, ISBN 0 444 874895; QA166.23.B4813.
5 Bishop, M., 1999. Genetics Databases, Academic Press.
6 Bray, T., Paoli, J., Sperberg-McQueen, 1998. “Extensible Markup Language (XML) 1.0,” W3C February Recommendation, available online at http://www.w3.org/TR/REC-xml.
7 Delobel, C., Reynaud, C., Rousset, M-C., Sirot, J-P., Vodislav, D., 2003. Semantic integration in Xyleme: a uniform tree-based approach, In Elsevier’s Journal of Data & Knowledge Engineering 44, Pages: 267–298.
8 Deutsch, A., Tannen, V., 2003. Reformulation of XML Queries and Constraints, In Proceedings of the 9th International Conference on Database Theory (ICDT), Pages 225-241.
9 Deutsch, A., Tannen, V., 2005. XML queries and constraints, containment and reformulation, Elsevier’s Journal of Theoretical Computer Science, 336 Pages: 57-87
10 Eiter, T., Gottlob, G., 1995. Identifying the minimal transversals of a hypergraph and related problems. SIAM Journal on Computing, 24(6), Pages: 1278-1304.
11 Fundulaki, I., Amann, B., Beeri, C., Scholl, M., 2002. STYX: Connecting the XML World to the World of Semantics Web resources. In Proceedings of EDBT' 2002, Prague, Czech Republic
12 Gottlob, G., Koch, C., Schulz, K.U, 2004. Conjunctive Queries over Trees, In Proceedings 23rd ACM SIGMOD-SIGART Symposium on Principles of Database Systems (PODS 2004), Paris, France. ACM Press, New York, USA, Pages: 189-200
13 Halevy, A., 2001. Answering queries using views: a survey, In Proceedings of Very Large Data Bases. 10 (4), Pages: 270–294.
14 Halevy, A., Ives Z., Tatarinov I., Mork P., 2003. Piazza: Data management infrastructure for semantic web applications. In Proceedings of the International World Wide Web Conference.
15 Kavvadias, D., Stavropoulos, E., 2005. An Efficient Algorithm for The Transversal Hypergraph Generation, In Journal of Graph Algorithms and Applications, Vol.9, No.2, Pages: 239-264.
16 Kohler, J., 2004. Integration of Life Science databases, In Elsevier's Drug Discovery Today Journal, BIOSILICO Vol.2, No.2.
17 Lehti, P., Fankhauser, P., 2004. XML Data Integration with OWL: Experiences and Challenges, In Proceedings of Symposium on Applications and the Internet (SAINT'04), Pages: 160 -170.
18 Levy A., Rajaraman A., Ordille J., 1996. Querying Heterogeneous Information Sources Using Source Descriptions, In Proceedings of Very Large Data Bases Conference, pages 251-262, Mumbai, India.
19 Mannila, H., Raiha, K-J, 1994. The Design of Relational Databases. Addison -Wesley, Wokingham, England.
20 Manolescu, I., Florescu, D., Kossmann, D.K, 2001. Answering XML queries over heterogeneous data sources. In Proceedings of the 27th International Conference on Very Large Data Bases (VLDB ’01), Orlando, Pages: 241–250.
21 Rey, C., Toumani, F., Hacid, M.-S., Leger, A., 2003, An algorithm and a prototype for the dynamic discovery of e-services, Technical Report, LIMOS, Clemont-Ferrand, France.
22 Schlieder, T., 2001. ApproXQL: Design and Implementation of an Approximate Pattern Matching Language for XML, Technical Report, Freie Universitat Berlin.
23 Thompson, H.S., 2000. “XML Schema Part 1: Structures,” W3C, work-in-progress, current as of Apr. 2000.
Dr. Kunale Kudagba
- Morocco
kkunale@gmail.com
Associate Professor Hassan Badir
- Morocco
Professor Omar Ei Beqqali
USMBA University - Morocco