A preference-aware query model for data web services

Authors:
Soumaya Amdouni;Djamal Benslimane;Mahmoud Barhamgi;Allel Hadjali;Rim Faiz;Parisa Ghodous
Affiliations:
LIRIS Laboratory, Claude Bernard Lyon1 University, Villeurbanne, France;LIRIS Laboratory, Claude Bernard Lyon1 University, Villeurbanne, France;LIRIS Laboratory, Claude Bernard Lyon1 University, Villeurbanne, France;Enssat, University of Rennes 1, Lannion, France;University of Carthage-IHEC, Carthage, Tunisia;LIRIS Laboratory, Claude Bernard Lyon1 University, Villeurbanne, France
Venue:
ER'12 Proceedings of the 31st international conference on Conceptual Modeling
Year:
2012

Citing 15
Cited 0

Beyond min aggregation in multicriteria decision: (ordered) weighted min, discri-min, leximin

The ordered weighted averaging operators
Optimal aggregation algorithms for middleware

Journal of Computer and System Sciences - Special issu on PODS 2001
Supporting top-k join queries in relational databases

The VLDB Journal — The International Journal on Very Large Data Bases
Enterprise information mashups: integrating information, simply

VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Query optimization over web services

VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Deploying and managing Web services: issues, solutions, and directions

The VLDB Journal — The International Journal on Very Large Data Bases
UQBE: uncertain query by example for web service mashup

Proceedings of the 2008 ACM SIGMOD international conference on Management of data
A survey of top-k query processing techniques in relational database systems

ACM Computing Surveys (CSUR)
SOA What?

Computer
CAFISE-S: An Approach to Deploying SOA in Scientific Information Integration

ICWS '08 Proceedings of the 2008 IEEE International Conference on Web Services
A Query Rewriting Approach for Web Service Composition

IEEE Transactions on Services Computing
Interacting with the SOA-Based Internet of Things: Discovery, Query, Selection, and On-Demand Provisioning of Web Services

IEEE Transactions on Services Computing
Building ranked mashups of unstructured sources with uncertain information

Proceedings of the VLDB Endowment
On Evaluating and Publishing Data Concerns for Data as a Service

APSCC '10 Proceedings of the 2010 IEEE Asia-Pacific Services Computing Conference
Adaptive parallelization of queries to data providing web service operations

Transactions on Large-Scale Data- and Knowledge-Centered Systems V

Quantified Score

Hi-index	0.00

Visualization

Abstract

Data Mashup is a special class of applications mashup that combines data elements from multiple data sources (that are often exported as data web services) to respond to transient business needs on the fly. In this paper, we propose a semantic model for data services along with a declarative approach for creating data mashups without any programming involved. Given a query formulated over domain ontologies, and a set of preferences modeled using the fuzzy set theory, our approach selects the relevant data services based on their semantic modeling using an RDF query rewriting algorithm. Selected services are then orchestrated using a ranking-aware algebra to rank their returned results based on user's preferences at the data mashup execution time.