WS-Sky: An Efficient and Flexible Framework for QoS-Aware Web Service Selection

Size: px
Start display at page:

Download "WS-Sky: An Efficient and Flexible Framework for QoS-Aware Web Service Selection"

Transcription

1 202 IEEE Ninth International Conference on Services Computing WS-Sky: An Efficient and Flexible Framework for QoS-Aware Web Service Selection Karim Benouaret, Djamal Benslimane University of Lyon, LIRIS/CNRS Villeurbanne, France {karim.benouaret, Allel Hadjali Rennes University, ENSSAT/IRISA Lannion, France Abstract With the development of Service oriented Computing (SOC), more and more functionally similar Web services are deployed over the Web. Quality of service (QoS) aspects (e.g., availability, response time, etc.) are thus crucial for selecting among functionally similar Web services. Moreover, the skyline has been considered as an important concept for selecting Web service based on QoS. In this paper, we propose WS-Sky, a Web service selection framework based on QoS. Our framework leverages two variants of the notion of skyline to effectively and efficiently select Web services that better fit the user needs. Our experimental evaluation on both real-world and synthetic datasets demonstrates that WS-Sky assists users to find the most relevant Web services in a flexible way, and allows users to control the size of the retrieved Web services. Keywords-Web service selection; skyline analysis; QoS; I. INTRODUCTION Web services are software systems that have a well defined interface and perform a specific task. Typical examples include stateful Web services, altering the world state (e.g., an on-line shopping Web service or an on-line booking Web service), and stateless Web services, returning information to the user, (e.g., a weather Web service or news Web service). Web services can be published, located and invoked across the Web using a set of standards such as SOAP, WSDL and UDDI [], [2]. Formally, a Web service is described by the names and types of input and output parameters, constraints, preconditions and effects, as well as Quality of Service (QoS) attributes, such as price, response time, etc. Recently, there has been a large flow of Web services deployed over the Web, due to the acceptance of Service Oriented Architecture (SOA) as the solution to interoperation, reuse and globalization [3], [4]. The statistics published by the Web services search engine seekda! indicates an exponential increase in the number of accessible Web services over the last 67 months. In addition, according to [5], there has been more than 30% growth in the number of published Web services between October 2006 and October As the Web is populated with a large number of Web services, there may be multiple service providers competing to offer the same functionality, but with different QoS. QoS is thus a crucial criterion to select among functionally similar Web services. Table I: A set of functionally similar Web services Web service q ($) q 2 (ms) q 3 (ms) q 4 (%) is skyline s yes s yes s yes s yes s yes s yes s no s no s no s no Example. Consider a Search Engine Web service. Typically, there are too many Web services providing this functionality (e.g., Google Search, Amazon Search, etc.), but with different QoS. Assume that the Web services in Table I provide such functionality. For each Web service Table I sets its values on four QoS parameters q, q 2, q 3 and q 4, say price, response time, latency and accuracy (i.e., the rate of errors produced by the service), respectively. To select a satisfactory Web service, users usually need to examine all of them manually. This would be very painstaking. Computing the skyline comes a popular solution for eliminating candidate Web services [6], [7], [8] as it overcomes the major limitation of the current approaches that require users to assign weights over different QoS attributes. The skyline is a subset of Web services that are not (Pareto) dominated by any other Web service. A Web service s i is said to dominate another Web service s j if and only if s i is better than or equal to s j in all QoS parameters and better than s j in at least one QoS parameter. For instance, Web service s 4 dominates Web services s 7 and s 8.AWeb service that belongs to the skyline is said to be a skyline Web service. The column is skyline of Table I indicates if a Web service is (or not) a skyline Web service. As it can be seen the skyline comprises 60% of the candidate Web services. Also, the size of the skyline increases significantly with the increase of the number of QoS attributes since as the number of QoS attributes increases, /2 $ IEEE DOI.9/SCC

2 for any Web service s i, it is more likely there is another Web service s j where s i and s j are better than each other in different QoS attributes. Thus, it may be hard for users to make a good and quick selection. In addition, as mentioned in [8], the skyline may lose some interesting Web services. For example, Web services s 7 and s 8 are not in the skyline as they are both dominated by Web service s 4. Furthermore, s 4 may be currently unavailable (e.g., error 404). Users thus have to choose between the other Web services retuned by the skyline, while s 7 and s 8 may be more appropriate. Requirements. To overcome the above insufficiencies, a system may be required to meet the following requirements. (R ) Skyline size requirement: further reduce the size of the skyline when needed (case of large skyline set). (R 2 ) Skyline quality requirement: include some interesting Web services that are not in the skyline and eliminate Web services that are in the skyline but with a bad compromise between QoS parameters, i.e., those that are good in some QoS parameters and very bad in the other ones (e.g., s 3 ). Contribution. Motivated by this, we propose a novel concept called σ-dominant skyline based on an extension of the (Pareto) dominance relationship. Specifically, the σ-dominant skyline satisfies requirements R. In [8], we proposed the α-dominant skyline based on another extension of the (Pareto) dominance relationship. Specifically, the α- dominant skyline satisfies requirements R 2. In this paper, we present WS-Sky (Web Service Skyline), an efficient and flexible Web service selection framework that implement the above mentioned skyline variants. We demonstrate that our framework assists users to find the most relevant Web services in a flexible way, and allows users to control the size of the retrieved Web services. Outline. The rest of the paper is structured as follows. Section II reviews related work. Section III describes our framework including the user interface, the skyline variants and the system architecture. Section IV presents our experimental study. Section V discusses some lessons learned in this research. Finally, Section VI concludes the paper. II. RELATED WORK During the last years, the problem of QoS-based Web service selection has received a lot of attention in the service computing community. In [9], the authors propose an extensible QoS computation model that supports an open and fair management of QoS data by incorporating user feedback. In [], [9], Zeng et al. propose a general and extensible model to evaluate QoS of both elementary and composite services. The authors use linear programming techniques to find the optimal selection of component services. Similarly, Ardagna et al. [2] extend the linear programming model to include local constraints. In [3], the authors studied the problem of service selection with multiple QoS constraints. The authors propose two models for the QoS-based service composition problem: a combinatorial model and a graph model. A heuristic algorithm is introduced for each model. Wang et al. [4] introduce QoS-based selection of semantic web services, the authors present a QoS ontology and selection algorithm to evaluate multiple qualities. However, these approaches require users to assign weights to QoS attributes. They thus suffer from lack of flexibility. Skyline analysis, which came from old research topics like contour problem [5], maximum vectors [6] and convex hull [7], was introduced into database domain by Börzsönyi et al. [8], which develop three algorithms: BNL, D&C and B-tree. Since, several algorithms have been developed to compute the skyline. They can be categorized into nonindex-based algorithms; e.g., SFS [9], LESS [20], SaLSa [2] and OSP [22], and index-based algorithms; e.g., Index [23], NN [24], BBS [25] and ZSearch [26]. However, computing the skyline Web services based on QoS is not practical, as (i) the size of the skyline is often very large and (ii) the skyline privileges Web services with a bad compromise between QoS attributes; thus the full skyline is not always informative. To address the first problem (i.e., the large size of the skyline), selecting on the basis of skyline variants has been investigated in the database community [29], [30], [27], [28], and recently in the service computing community [6], [8]. In [27], Lin et al. propose the top-k representative skyline, so that the k skyline points with the maximal number of dominated points can be produced. However, this approach often return similar points [28]. For diversifying the result, Tao et al. propose in [28] the distance based representative skyline. A similar approach is adapted in [6] for selecting Web services based on QoS. However, these approaches are only useful with anti-correlated datasets [6]. In [29], the authors propose the top-k skyline frequency. The skyline frequency of a point p is the number of subspaces where p is a skyline point. However, the exact algorithm results in a high computational cost as it needs to compute the skyline for each subspace. In [30], Chan et al. relax the notion of (Pareto) dominance to k-dominance, so that more of points are dominated. A point p is said to k-dominate another point q if and only if there are k dimensions in which p dominates q. The k-dominant skyline consists of the subset of points that are not k-dominated. However, the k-dominant skyline often returns an empty set. For instance, in our example, if k<4 the k-dominant skyline is empty. Specifically, we have s i is k-dominated by s i+ for i [, 5] and s 6 is k-dominated by s. Thus the k-dominant skyline can only return the skyline (with k =4). In addition, these approaches do not address the second problem (i.e., the privilege of Web services with a bad compromise between QoS attributes). In [8], we propose the α-dominant skyline, satisfying requirements R 2, i.e., privileging Web services with a good compromise between QoS parameters. In this work, we propose an unified framework, satisfying both R and R

3 Figure : A screenshot of the WS-Sky user interface. III. FRAMEWORK OVERVIEW In this section, we describe WS-Sky, including the user interface, our skyline variants and the system architecture. A. User Interface Figure presents a screenshot of the WS-Sky user interface. This interface was implemented with Java Swing. The user interacts with the system by issuing a selection query. More specifically, the query consists of a keyword which represents the functionality of the desired Web service (e.g., Search, News, etc.) as well as a set of desired QoS parameters. The user also chooses one of the skyline variants described in Section III-B (i.e., σ-dominant skyline or α- dominant skyline). WS-Sky evaluates the query, selects the most relevant Web services using the process described in Section III-C and returns the result set to the user. The result consists of the QoS of the retrieved Web services as well as their WSDL addresses as shown in the bottom of Figure. B. Skyline Variants At the heart of WS-Sky lie two skyline variants, the σ-dominant skyline (the quantitative variant) and the α- dominant skyline (the qualitative variant). We describe these skyline variants below. Given a set of d QoS parameters Q = {q,...,q d } and a set of functionally similar Web services S = {s,...,s n }. We use b(s i,s j ), w(s i,s j ), e(s i,s j ) to denote the number of QoS parameters where s i is better than, worse than and equal to s j, respectively. We also use q k (s i ) to denote the k th QoS value of s i. ) σ-dominant skyline: Consider Web services s 3 and s 4 in our example. With Pareto order, s 3 and s 4 are incomparable, i.e., neither s 3 dominates s 4 nor s 4 dominates s 3. However, s 4 is better than s 3 in three QoS parameters (q, q 3 and q 4 ), while s 3 is better than s 4 in only one QoS parameter (q 2 ). To overcome this limitation, we defined the notion of σ-dominance as follows: Definition. (σ-dominance) A Web service s i σ-dominates another Web service s j if b(s and only if e(s i,s j ) d and i,s j) d+w(s i,s j) e(s i,s j) σ. With σ [0, ]. Let us now reconsider Web services s 3 and s 4. With σ = 0.6, wehaves dominates s 3 and s 3 not 0.6-dominates s 4. This is more significant than s 3 and s 4 are incomparable provided by Pareto dominance. We can now define the σ- dominant skyline in the following way: Definition 2. (σ-dominant skyline) The σ-dominant skyline of S, denoted by σ-sky S, comprises the set of Web services in S that are not σ-dominated by any other Web service in S. In our example, with σ =0.6, the 0.6-dominant skyline comprises Web services s 2, s 4, s 5 and s 6. This instance shows that the σ-dominant skyline satisfies requirement R recall that the skyline comprises Web services s, s 2, s 3, s 4, s 5 and s 6. Theorem. If σ <σ, then σ -sky S σ-sky S. Proof: Assume that there exists a Web service s i, such that s i σ -sky S and s i / σ-sky S. Since s i / σ-sky S, there must exist a Web service s j such that s j σ-dominates b(s s i, i.e., j,s i) d+w(s σ. Thus, b(s j,s i) j,s i) e(s j,s i) d+w(s j,s i) e(s j,s i) σ as σ <σ. Hence, s j σ -dominates s i. Which leads to a contradiction as s i σ -sky S. From Theorem, we can see that the size of the σ- dominant skyline decreases with the decrease of σ and vice versa. Thus, the σ-dominant skyline allows users to control the size of the returned Web services. Remark. Note that, when σ =, σ-dominance is equivalent to Pareto dominance. Thus, the σ-dominant skyline is equivalent to the (Pareto) skyline. This means that our σ- dominant skyline can also return the (Pareto) skyline. 2) α-dominant skyline: To allow for an uniform measurement of Web service qualities independent of units, we normalize the different QoS values in the range [0, ], such that the lower the value, the higher the quality, as follows: For negative QoS parameters, i.e., the higher the value, the lower the quality (e.g., response time, latency, etc): N qk (s i) = q k(s i) min qk max qk min qk. For positive QoS parameters, i.e., the higher the value, the higher the quality (e.g., availability, reliability, etc.): N qk (s i) = maxq k q k(s i) max qk min qk. Where N qk (s i) is the normalized QoS value of the Web service s i on the QoS parameter q k and min qk (resp. max qk ) is the minimum (resp. maximum) value of the QoS parameter q k. Table II shows the QoS values of Web services in Table I after normalization

4 Table II: Web Services with Normalized QoS Values Web service q q 2 q 3 q 4 s s s s s s s s s s Theorem 2, shows that the size of the α-dominant skyline decreases with the decrease of α and vice versa. Thus, the α-dominant skyline also allows users to control the size of the returned Web services. Remark. It is worth to note that the α-dominant skyline can be applied when QoS values are not normalized. However, users are required to assign a specific ε and λ for each QoS parameter. This is a rather demanding task. For this purpose, our system normalizes the different QoS values in the range [0, ] as described above. Consider Web services s 4 and s 6 in our example. Applying Pareto dominance, we have neither s 4 dominates s 6 nor s 6 dominates s 4 because s 4 is better than s 6 in q 3 and q 4, and s 6 is better than s 4 in q and q 2. However, the QoS values where s 6 is better than s 4 are very closed, i.e., s 6 (q )=0 is closed to s 4 (q ) = 0.7 and s 6 (q 2 ) = 0.6 is closed to s 4 (q 2 )=0.8, while, s 4 (q 4 )=0is much smaller than s 6 (q 4 )=0.67 even if s 4 (q 3 ) is closed to s 6 (q 3 ). Motivated by this inadequacy, we define the notion of α-dominance as: Definition 3. (α-dominance) A Web service s i α-dominates another Web service s j if and d k= only if μ ε,λ(q k (s i),q k (s j)) d α. With α [0, ]. Where, μ ε,λ is a monotone comparison function that expresses the extent to which q k (s i ) is (more or less) strongly greater than q k (s j ). μ ε,λ is defined as: 0 ify x ε μ ε,λ (x, y) = ify x λ + ε y x ε λ otherwise Where ε 0 and λ>0. For more details, see [8]. Let us now reconsider Web services s 4 and s 6. With ε =0.02, λ =0.2 and α =0.5 we have s dominates s 6 and s 6 not 0.5-dominates s 4. Like σ-dominance, α- dominance is also more significant than Pareto dominance. The α-dominant skyline is defined in the following way: Definition 4. (α-dominant skyline) The α-dominant skyline of S in the context μ ε,λ, denoted by α-skyμ S ε,λ, comprises the set of Web services in S that are not α-dominated by any other Web service in S. In our example, with ε =0.02, λ =0.2 and α =0.7, the 0.7-dominant skyline comprises Web services s 2, s 4, s 5, s 6, s 7 and s 8. One can see that, Web services s and s 3, which are with a bad compromise between QoS parameters are discarded from the result, and Web services s 7 and s 8 which are (moderately) good in all QoS parameters are included. This instance shows that the α-dominant skyline satisfies requirement R 2. Theorem 2. If α <α, then α -skyμ S ε,λ α-skyμ S ε,λ. Proof: In a similar way as Theorem. Figure 2: WS-Sky Architecture. C. System Architecture WS-Sky was implemented in Java. Figure 2 describes the Architecture of WS-Sky. The main components of our system are the Service Annotator, the Service Locator and the Service Selector. The service registry is external and is accessed by our system at query time. The Service Annotator allows service providers to annotate WSDL description files of their Web services with (i) a tag representing the functionality of the Web service (e.g., Search, Weather forecast, etc.) and (ii) the different QoS values of the Web service. The Service Locator receives the keyword of the user query and communicates with the service registry in order 4 49

5 to select a set of candidate Web services that match the user query, i.e., their tags match the keyword of the user query. The Service Locator then sends the retrieved Web services (functionally similar Web services) to the Service Selector. The role of the Service Selector is to select the most relevant Web services based on QoS. The Service Selector consists of two main modules : the σ-dominant skyline and the α-dominant skyline. The α-dominant skyline uses the QoS Normalizer to normalize the QoS values in the way describes in the previous Section. At the beginning the Service Selector receives the user s desired skyline variant and its parameters (i.e., σ or α, ε and λ) and wait for a set of candidate Web services from the Service Locator. When receiving the candidate Web services, it computes the desired skyline variant using the different modules mentioned above and returns the result to the user. IV. EXPERIMENTAL EVALUATION In this section, we present an experimental evaluation of our approach, focusing on the size of the σ-dominant skyline and that of the α-dominant skyline. We also compute the size of the skyline for comparison purpose. In our evaluation, we experimented with both real-world and synthetic datasets. A. On Real-world Dataset We used the publicly available dataset QWS 2, which comprises measurement of nine QoS parameters for 2507 real-world Web services. These Web services were collected from public sources on the Web, and their QoS values were measured using commercial benchmark tools. More details about this dataset can bee found in [5]. For our experimental evaluation, we tagged each Web service by its functionality. For the purpose of our evaluation on real-life dataset, we considered two types of scenarios: (i) when a high number of QoS attributes is considered and (ii) when a low number of QoS attributes is considered. Table III: Size of the skyline variants ( Q =9) σ σ-sky α α-sky ) On a high number of QoS attributes: Table III shows the size of our skyline variants on different values of σ and α (ε =0.02 and λ =0.2 for the α-dominant skyline) for the keyword Search when considering nine QoS parameters. In this case, the skyline comprises 50 Web services, i.e., the size of the skyline is very large. Thus users will be overwhelmed during the selection process if the skyline is considered. From Table III, we can see that the size of the σ-dominant skyline and that of the α-dominant skyline increase with the increase of σ and α respectively. This 2 qmahmoud/qws/dataset/qws Dataset v2.txt conforms with both Theorem and Theorem 2. We can also see that in this scenario, i.e., when a high number of QoS parameters is considered, the σ-dominant skyline is more interesting than the α-dominant skyline. This is because, the size of the skyline is very large, and the σ-dominant skyline further reduces the size of the skyline, while the α-dominant skyline returns a large number of Web services for α>0.5. Table IV: Size of the skyline variants ( Q =5) σ σ-sky α α-sky ) On a low number of QoS attributes: Table IV shows the size of our skyline variants on different values of σ and α (ε =0.02 and λ =0.2 for the α-dominant skyline) for the keyword Search when considering five QoS parameters. In this case, the skyline consists of 7 Web services, i.e., the size of the skyline is quite small. From Table IV, we can also see that the size of the σ-dominant skyline and that of the α-dominant skyline increase with the increase of σ and α respectively. In addition, as shown in Table IV, the α-dominant skyline is more robust than the σ-dominant skyline. This is because, the size of the skyline is quite small, and the α-dominant skyline include somme interesting Web service (i.e., Web services with a good compromise between QoS parameters), while the size of the σ-dominant skyline is very small for σ<0.7. B. On Synthetic Datasets We used a publicly available synthetic generator 3 to obtain different datasets, varying three parameters: cardinality, dimensionality and distribution. The cardinality is the number of synthetic Web services in the dataset, while the dimensionality is the number of QoS attributes of each Web service in the dataset. There are three distributions in the synthetic datasets: correlated, independent and anticorrelated. In the correlated datasets, the QoS values of each Web service is positively correlated, i.e., a good value in some QoS attribute increases the possibility of a good value in the others. In the independent datasets, QoS values are independent each other. In the anti-correlated datasets, the QoS values of each Web service are negatively correlated, i.e., good values (or bad values) in all QoS attributes are less likely to occur. Table V lists the used notation ) Effect of Cardinality: Figure 3 shows that the size of σ-sky is insensitive to n at all. this is because as n varies more Web services may have chances not to be σ- dominated on the one hand, and more Web services have possibilities to be σ-dominated on the other hand. However, the size of α-sky follows similar trends to that of Sky for the

6 Cardinality [K] Cardinality [K] Cardinality [K] (a) Correlated (b) Independent (c) Anti-correlated Figure 3: Size vs n (d =6, σ =0.6, α =0.6) Dimensionality Dimensionality Dimensionality (a) Correlated (b) Independent (c) Anti-correlated Figure 4: Size vs d (n =6K, σ =0.6, α =0.6) Threshold Threshold Threshold (a) Correlated (b) Independent (c) Anti-correlated Figure 5: Size vs σ and α (n =6K, d =6). Table V: The summary of notation Notation Description Default n Cardinality 6K d Dimensionality 6 σ σ threshold 0.6 α α threshold 0.6 σ-sky σ-dominant skyline N/A α-sky α-dominant skyline N/A Sky Skyline N/A correlated and the independent datasets, i.e., it increases with the increase of n, while the size of α-sky is insensitive to n for the anti-correlated dataset and is very smaller than the size of Sky. As the anti-correlated dataset comprises a large number of Web services with a bad compromise between QoS attributes, they are thus excluded from the result. In contrast to the anti-correlated dataset, the size of α-sky is larger than that of Sky for the correlated dataset, as this last comprises a large number of Web services with a good compromise between QoS attributes, they are thus included in the result. For the independent dataset, the size of α-sky slightly smaller than that of Sky as some Web services (Web 43 5

7 service with a good compromise between QoS attributes) are included in the result on the one hand, and more Web services (Web service with a bad compromise between QoS attributes) are excluded from the result. Contrary to α-sky, the size of σ-sky is always smaller than the size of Sky as σ-sky is a subset of Sky. From this set of experiments, we can see that both σ-sky and Sky are more interesting for the correlated dataset as the α-sky returns a large number of Web services even if most of then are with a good compromise between QoS attributes, while for the independent dataset, σ-sky is more interesting. For the anti-correlated dataset, both σ-sky and α-sky are relevant, however, α-sky is more robust as it removes Web service with a bad compromise between QoS attributes. 2) Effect of Dimensionality: Figure 4 shows that in contrast to Sky whose the size increases significantly as d increases, d has no obvious effect on the size of σ-sky and the size of α-sky. This is related to the definition of each dominance variant, i.e., the (Pareto) dominance, the σ-dominance and the α-dominance relationships. Indeed, unlike σ-sky and α-sky, for Sky, when d increases, a Web service has better opportunity not to be dominated in all QoS attributes. Comparing the size of σ-sky and that of Sky, we can also observe that the size of σ-sky is constantly smaller than the size of Sky since σ-sky is a subset of Sky. In contrast to σ- Sky, the size of α-sky is larger than that of Sky for the correlated dataset. Since the correlated dataset comprises a large number of Web services with a good compromise between QoS attributes, they are thus included in the result. However for the independent and correlated datasets, the size of α-sky is larger than that of Sky when d is small, while smaller otherwise. Since when d is small, Web services with a good compromise between QoS attributes are more likely to occur for the independent dataset, they thus included in the result, while, for the anti-correlated dataset Web services with a good compromise between QoS attributes are less likely to occur, thus there are not enough Web services with a good compromise between QoS attributes to α-dominate others (i.e., those with a bad compromise between QoS attributes). From the results of this set of experiments, we can see that σ-sky is more interesting for both correlated and independent datasets, while both σ-sky and α-sky are interesting for the anti-correlated dataset. But, α-sky is more robust (except for d =2). 3) Effect of σ and α Thresholds: σ and α thresholds have a significant effect on the size of σ-sky and the size of α- Sky, respectively as shown is Figure 5 (the size of Sky does not change as it is not related to σ or α). This is because σ -Sky is a subset of σ-sky, if σ <σon the one hand (Theorem ), and α -Sky is a subset of α-sky, if α <αon the other hand (Theorem 2). From the results of this set of experiments, we can see that the right values of σ and α depends on the dataset. On the correlated dataset, for σ-sky, we must choose σ 0.6, since for σ<0.6, σ-sky returns an empty set, while for α-sky, α 0.6 is more interesting, since if σ>0.6, α-sky returns a large number of Web services. This is similar to the independent dataset. However, on the anti correlated dataset, we must choose 0.6 σ 0.7 for σ-sky, and α =0.6 for α-sky. V. LESSONS LEARNED In this section, we present some lessons learned from the use of our proposed system (i.e., WS-Sky) for selecting Web services based on QoS parameters. From the analysis in Section III-B and the results of our experiments on both real-world and synthetically generated datasets, we can observe that WS-Sky is (i) efficient since it assists user to find the most relevant Web services, and (ii) flexible since it allows users to control the size of the retrieved Web services by increasing and decreasing σ and α for the σ-dominant skyline and the α-dominant skyline, respectively. In other words, WS-Sky can support feedback from users. In addition, we can observe that the choice of the σ- dominant skyline or the α-dominant skyline depends on the Web services dataset. For example, on real-world dataset, we can see that the σ-dominant skyline is more robust than the α-dominant skyline on high number of QoS attributes, while the α-dominant skyline is more interesting on low number of QoS attributes but this is not valid for d = 2 (i.e., a low number of QoS attributes) on the synthetic datasets. This is related to (i) the five considered QoS attributes, i.e., if we considered five other QoS parameters, we can obtain different results, and (ii) the considered keyword, i.e., if we considered another keyword (different to Search ) we can also obtain different results. From these observations, we can see that the σ-dominant skyline and the α-dominant skyline are complementary, and alternative to the traditional skyline, since they satisfy respectively requirements R and R 2, and the σ-dominant skyline can also return the skyline (see Section III-B). VI. CONCLUSION In this paper, we have addressed the problem of Web service selection based on QoS and proposed WS-Sky, an efficient and flexible Web service selection framework, which leverages two skyline variants alternative to the traditional skyline. We have demonstrated that WS-Sky helps users select the most relevant Web services in a flexible way. An interesting future direction is to develop modules for collecting Web services from the Internet, and integrate them into WS-Sky to improve it

8 REFERENCES [] M. P. Papazoglou and D. Georgakopoulos, Introduction, Commun. ACM, vol. 46, no., pp , [2] F. Curbera, M. J. Duftler, R. Khalaf, W. Nagy, N. Mukhi, and S. Weerawarana, Unraveling the web services web: An introduction to soap, wsdl, and uddi, IEEE Internet Computing, vol. 6, no. 2, pp , [3] M. P. Papazoglou and W.-J. van den Heuvel, Service oriented architectures: approaches, technologies and research issues, VLDB J., vol. 6, no. 3, pp , [4] Q. Yu, X. Liu, A. Bouguettaya, and B. Medjahed, Deploying and managing web services: issues, solutions, and directions, VLDB J., vol. 7, no. 3, pp , [5] E. Al-Masri and Q. H. Mahmoud, Investigating web services on the world wide web, in WWW, 2008, pp [6] M. Alrifai, D. Skoutas, and T. Risse, Selecting skyline services for qos-based web service composition, in WWW, 20, pp. 20. [7] Q. Yu and A. Bouguettaya, Computing service skylines over sets of services, in ICWS, 20, pp [8] K. Benouaret, D. Benslimane, and A. HadjAli, On the use of fuzzy dominance for computing service skyline based on qos, in ICWS, 20, pp [9] Y. Liu, A. H. H. Ngu, and L. Zeng, Qos computation and policing in dynamic web service selection, in WWW (Alternate Track Papers & Posters), 2004, pp [] L. Zeng, B. Benatallah, M. Dumas, J. Kalagnanam, and Q. Z. Sheng, Quality driven web services composition, in WWW, 2003, pp [] L. Zeng, B. Benatallah, A. H. H. Ngu, M. Dumas, J. Kalagnanam, and H. Chang, Qos-aware middleware for web services composition, IEEE Trans. Software Eng., vol. 30, no. 5, pp , [2] D. Ardagna and B. Pernici, Adaptive service composition in flexible processes, IEEE Trans. Software Eng., vol. 33, no. 6, pp , [3] T. Yu, Y. Zhang, and K.-J. Lin, Efficient algorithms for web services selection with end-to-end qos constraints, TWEB, vol., no., [4] X. Wang, T. Vitvar, M. Kerrigan, and I. Toma, A qos-aware selection model for semantic web services, in ICSOC, 2006, pp [5] D. H. McLain, Drawing contours from arbitrary data points, Comput. J., vol. 7, no. 4, pp , 974. [6] H. T. Kung, F. Luccio, and F. P. Preparata, On finding the maxima of a set of vectors, J. ACM, vol. 22, no. 4, pp , 975. [7] F. P. Preparata and M. I. Shamos, Computational Geometry - An Introduction. Springer, 985. [8] S. Börzsönyi, D. Kossmann, and K. Stocker, The skyline operator, in ICDE, 200, pp [9] J. Chomicki, P. Godfrey, J. Gryz, and D. Liang, Skyline with presorting, in ICDE, 2003, pp [20] P. Godfrey, R. Shipley, and J. Gryz, Maximal vector computation in large data sets, in VLDB, 2005, pp [2] I. Bartolini, P. Ciaccia, and M. Patella, Efficient sort-based skyline evaluation, ACM Trans. Database Syst., vol. 33, no. 4, [22] S. Zhang, N. Mamoulis, and D. W. Cheung, Scalable skyline computation using object-based space partitioning, in SIGMOD Conference, 2009, pp [23] K.-L. Tan, P.-K. Eng, and B. C. Ooi, Efficient progressive skyline computation, in VLDB, 200, pp [24] D. Kossmann, F. Ramsak, and S. Rost, Shooting stars in the sky: An online algorithm for skyline queries, in VLDB, 2002, pp [25] D. Papadias, Y. Tao, G. Fu, and B. Seeger, An optimal and progressive algorithm for skyline queries, in SIGMOD Conference, 2003, pp [26] K. C. K. Lee, B. Zheng, H. Li, and W.-C. Lee, Approaching the skyline in z order, in VLDB, 2007, pp [27] X. Lin, Y. Yuan, Q. Zhang, and Y. Zhang, Selecting stars: The k most representative skyline operator, in ICDE, 2007, pp [28] Y. Tao, L. Ding, X. Lin, and J. Pei, Distance-based representative skyline, in ICDE, 2009, pp [29] C. Y. Chan, H. V. Jagadish, K.-L. Tan, A. K. H. Tung, and Z. Zhang, On high dimensional skylines, in EDBT, 2006, pp [30], Finding k-dominant skylines in high dimensional space, in SIGMOD, 2006, pp

A Study on External Memory Scan-based Skyline Algorithms

A Study on External Memory Scan-based Skyline Algorithms A Study on External Memory Scan-based Skyline Algorithms Nikos Bikakis,2, Dimitris Sacharidis 2, and Timos Sellis 3 National Technical University of Athens, Greece 2 IMIS, Athena R.C., Greece 3 RMIT University,

More information

Finding Skylines for Incomplete Data

Finding Skylines for Incomplete Data Proceedings of the Twenty-Fourth Australasian Database Conference (ADC 213), Adelaide, Australia Finding Skylines for Incomplete Data Rahul Bharuka P Sreenivasa Kumar Department of Computer Science & Engineering

More information

k-dominant and Extended k-dominant Skyline Computation by Using Statistics

k-dominant and Extended k-dominant Skyline Computation by Using Statistics k-dominant and Extended k-dominant Skyline Computation by Using Statistics Md. Anisuzzaman Siddique Graduate School of Engineering Hiroshima University Higashi-Hiroshima, Japan anis_cst@yahoo.com Abstract

More information

The Multi-Relational Skyline Operator

The Multi-Relational Skyline Operator The Multi-Relational Skyline Operator Wen Jin 1 Martin Ester 1 Zengjian Hu 1 Jiawei Han 2 1 School of Computing Science Simon Fraser University, Canada {wjin,ester,zhu}@cs.sfu.ca 2 Department of Computer

More information

DERIVING SKYLINE POINTS OVER DYNAMIC AND INCOMPLETE DATABASES

DERIVING SKYLINE POINTS OVER DYNAMIC AND INCOMPLETE DATABASES How to cite this paper: Ghazaleh Babanejad, Hamidah Ibrahim, Nur Izura Udzir, Fatimah Sidi, & Ali Amer Alwan. (2017). Deriving skyline points over dynamic and incomplete databases in Zulikha, J. & N. H.

More information

Multicore based Spatial k-dominant Skyline Computation

Multicore based Spatial k-dominant Skyline Computation 2012 Third International Conference on Networking and Computing Multicore based Spatial k-dominant Skyline Computation Md. Anisuzzaman Siddique, Asif Zaman, Md. Mahbubul Islam Computer Science and Engineering

More information

International Journal of Software and Web Sciences (IJSWS) Web service Selection through QoS agent Web service

International Journal of Software and Web Sciences (IJSWS)   Web service Selection through QoS agent Web service International Association of Scientific Innovation and Research (IASIR) (An Association Unifying the Sciences, Engineering, and Applied Research) ISSN (Print): 2279-0063 ISSN (Online): 2279-0071 International

More information

SUBSKY: Efficient Computation of Skylines in Subspaces

SUBSKY: Efficient Computation of Skylines in Subspaces SUBSKY: Efficient Computation of Skylines in Subspaces Yufei Tao Department of Computer Science City University of Hong Kong Tat Chee Avenue, Hong Kong taoyf@cs.cityu.edu.hk Xiaokui Xiao Department of

More information

QSkycube: Efficient Skycube Computation Using Point Based Space Partitioning

QSkycube: Efficient Skycube Computation Using Point Based Space Partitioning : Efficient Skycube Computation Using Point Based Space Partitioning Jongwuk Lee, Seung won Hwang epartment of Computer Science and Engineering Pohang University of Science and Technology (POSTECH) Pohang,

More information

Assisting Trustworthiness Based Web Services Selection Using the Fidelity of Websites *

Assisting Trustworthiness Based Web Services Selection Using the Fidelity of Websites * Assisting Trustworthiness Based Web Services Selection Using the Fidelity of Websites * Lijie Wang, Fei Liu, Ge Li **, Liang Gu, Liangjie Zhang, and Bing Xie Software Institute, School of Electronic Engineering

More information

Constrained Skyline Query Processing against Distributed Data Sites

Constrained Skyline Query Processing against Distributed Data Sites Constrained Skyline Query Processing against Distributed Data Divya.G* 1, V.Ranjith Naik *2 1,2 Department of Computer Science Engineering Swarnandhra College of Engg & Tech, Narsapuram-534280, A.P., India.

More information

Distributed Spatial k-dominant Skyline Maintenance Using Computational Object Preservation

Distributed Spatial k-dominant Skyline Maintenance Using Computational Object Preservation International Journal of Networking and Computing www.ijnc.org ISSN 2185-2839 (print) ISSN 2185-2847 (online) Volume 3, Number 2, pages 244 263, July 213 Distributed Spatial k-dominant Skyline Maintenance

More information

Finding k-dominant Skylines in High Dimensional Space

Finding k-dominant Skylines in High Dimensional Space Finding k-dominant Skylines in High Dimensional Space Chee-Yong Chan, H.V. Jagadish 2, Kian-Lee Tan, Anthony K.H. Tung, Zhenjie Zhang School of Computing 2 Dept. of Electrical Engineering & Computer Science

More information

Goal Directed Relative Skyline Queries in Time Dependent Road Networks

Goal Directed Relative Skyline Queries in Time Dependent Road Networks Goal Directed Relative Skyline Queries in Time Dependent Road Networks K.B. Priya Iyer 1 and Dr. V. Shanthi2 1 Research Scholar, Sathyabama University priya_balu_2002@yahoo.co.in 2 Professor, St. Joseph

More information

Keywords Skyline, Multi-criteria Decision Making, User defined Preferences, Sorting-Based Algorithm, Performance.

Keywords Skyline, Multi-criteria Decision Making, User defined Preferences, Sorting-Based Algorithm, Performance. Volume 4, Issue 7, July 2014 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Skyline Computation

More information

Dynamic Skyline Queries in Metric Spaces

Dynamic Skyline Queries in Metric Spaces Dynamic Skyline Queries in Metric Spaces Lei Chen and Xiang Lian Department of Computer Science and Engineering Hong Kong University of Science and Technology Clear Water Bay, Kowloon Hong Kong, China

More information

Keywords : Skyline Join, Skyline Objects, Non Reductive, Block Nested Loop Join, Cardinality, Dimensionality

Keywords : Skyline Join, Skyline Objects, Non Reductive, Block Nested Loop Join, Cardinality, Dimensionality Volume 4, Issue 3, March 2014 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Skyline Evaluation

More information

Adapting Skyline Computation to the MapReduce Framework: Algorithms and Experiments

Adapting Skyline Computation to the MapReduce Framework: Algorithms and Experiments Adapting Skyline Computation to the MapReduce Framework: Algorithms and Experiments Boliang Zhang 1,ShuigengZhou 1, and Jihong Guan 2 1 School of Computer Science, and Shanghai Key Lab of Intelligent Information

More information

Joint Entity Resolution

Joint Entity Resolution Joint Entity Resolution Steven Euijong Whang, Hector Garcia-Molina Computer Science Department, Stanford University 353 Serra Mall, Stanford, CA 94305, USA {swhang, hector}@cs.stanford.edu No Institute

More information

On High Dimensional Skylines

On High Dimensional Skylines On High Dimensional Skylines Chee-Yong Chan, H.V. Jagadish, Kian-Lee Tan, Anthony K.H. Tung, and Zhenjie Zhang National University of Singapore & University of Michigan {chancy,tankl,atung,zhangzh2}@comp.nus.edu.sg,

More information

Selecting skyline services for QoS-aware composition by upgrading MapReduce paradigm

Selecting skyline services for QoS-aware composition by upgrading MapReduce paradigm DOI 10.1007/s10586-012-0240-9 Selecting skyline services for QoS-aware composition by upgrading MapReduce paradigm Jian Wu Liang Chen Qi Yu Li Kuang Yilun Wang Zhaohui Wu Received: 15 April 2012 / Accepted:

More information

Diversity in Skylines

Diversity in Skylines Diversity in Skylines Yufei Tao Department of Computer Science and Engineering Chinese University of Hong Kong Sha Tin, New Territories, Hong Kong taoyf@cse.cuhk.edu.hk Abstract Given an integer k, a diverse

More information

Top-k Web Service Compositions using Fuzzy Dominance Relationship

Top-k Web Service Compositions using Fuzzy Dominance Relationship Top-k Web Service Compositions using Fuzzy Dominance Relationship Karim Benouaret, Djamal Benslimane, Allel Hadjali, Mahmoud Barhamgi To cite this version: Karim Benouaret, Djamal Benslimane, Allel Hadjali,

More information

d1 d2 d d1 d2 d3 (b) The corresponding bitmap structure

d1 d2 d d1 d2 d3 (b) The corresponding bitmap structure Efficient Progressive Skyline Computation Kian-Lee Tan Pin-Kwang Eng Beng Chin Ooi Department of Computer Science National University of Singapore Abstract In this paper, we focus on the retrieval of a

More information

Efficiently Evaluating Skyline Queries on RDF Databases

Efficiently Evaluating Skyline Queries on RDF Databases Efficiently Evaluating Skyline Queries on RDF Databases Ling Chen, Sidan Gao, and Kemafor Anyanwu Semantic Computing Research Lab, Department of Computer Science North Carolina State University {lchen10,sgao,kogan}@ncsu.edu

More information

Mining Thick Skylines over Large Databases

Mining Thick Skylines over Large Databases Mining Thick Skylines over Large Databases Wen Jin 1,JiaweiHan,andMartinEster 1 1 School of Computing Science, Simon Fraser University {wjin,ester}@cs.sfu.ca Department of Computer Science, Univ. of Illinois

More information

Friend Recommendation by Using Skyline Query and Location Information

Friend Recommendation by Using Skyline Query and Location Information Bulletin of Networking, Computing, Systems, and Software www.bncss.org, ISSN 2186 5140 Volume 5, Number 1, pages 68 72, January 2016 Friend Recommendation by Using Skyline Query and Location Information

More information

Revisited Skyline Query Algorithms on Streams of Multidimensional Data

Revisited Skyline Query Algorithms on Streams of Multidimensional Data Revisited Skyline Query Algorithms on Streams of Multidimensional Data Alexander Tzanakas, Eleftherios Tiakas, Yannis Manolopoulos Aristotle University of Thessaloniki, Thessaloniki, Greece Abstract This

More information

Efficient Computation of Group Skyline Queries on MapReduce

Efficient Computation of Group Skyline Queries on MapReduce GSTF Journal on Computing (JOC) DOI: 10.5176/2251-3043_5.1.356 ISSN:2251-3043 ; Volume 5, Issue 1; 2016 pp. 69-76 The Author(s) 2016. This article is published with open access by the GSTF. Efficient Computation

More information

34 Web Service Compositions with Fuzzy Preferences: A Graded Dominance Relationship Based Approach

34 Web Service Compositions with Fuzzy Preferences: A Graded Dominance Relationship Based Approach 34 Web Service Compositions with Fuzzy Preferences: A Graded Dominance Relationship Based Approach KARIM BENOUARET, LIRIS, Université Claude Bernard Lyon 1 DJAMAL BENSLIMANE, LIRIS, Université Claude Bernard

More information

Participatory Service Design Based on User-centered QoS

Participatory Service Design Based on User-centered QoS 2013 IEEE/WIC/ACM International Conferences on Web Intelligence (WI) and Intelligent Agent Technology (IAT) Participatory Service Design Based on User-centered QoS Donghui Lin and Toru Ishida Department

More information

Parallel Computation of Skyline Queries

Parallel Computation of Skyline Queries Parallel Computation of Skyline Queries Adan Cosgaya-Lozano Faculty of Computer Science Dalhousie University Halifax, NS Canada acosgaya@cs.dal.ca Andrew Rau-Chaplin Faculty of Computer Science Dalhousie

More information

Progressive Skyline Computation in Database Systems

Progressive Skyline Computation in Database Systems Progressive Skyline Computation in Database Systems DIMITRIS PAPADIAS Hong Kong University of Science and Technology YUFEI TAO City University of Hong Kong GREG FU JP Morgan Chase and BERNHARD SEEGER Philipps

More information

QOS-BASED RANKING MODEL FOR WEB SERVICE SELECTION CONSIDERING USER REQUIREMENTS

QOS-BASED RANKING MODEL FOR WEB SERVICE SELECTION CONSIDERING USER REQUIREMENTS QOS-BASED RANKING MODEL FOR WEB SERVICE SELECTION CONSIDERING USER REQUIREMENTS 1 G. VADIVELOU, 2 E. ILAVARASAN 1 Research Scholar, Dept. of CSE, Bharathiar University, Coimbatore, Tamilnadu, India 2 Professor,

More information

Future Research Directions in Skyline Computation

Future Research Directions in Skyline Computation Future Research Directions in Skyline Computation Ms. R.D. Kulkarni 1, Prof. Dr. B.F. Momin 2 1 Ms. R.D. Kulkarni, Department of Computer Engineering, K.K.W.I.E.E.R, Nasik, Maharashatra, India, rupaliwaje@rediffmail.com

More information

A Study on Reverse Top-K Queries Using Monochromatic and Bichromatic Methods

A Study on Reverse Top-K Queries Using Monochromatic and Bichromatic Methods A Study on Reverse Top-K Queries Using Monochromatic and Bichromatic Methods S.Anusuya 1, M.Balaganesh 2 P.G. Student, Department of Computer Science and Engineering, Sembodai Rukmani Varatharajan Engineering

More information

MapReduce-Based Computation of Area Skyline Query for Selecting Good Locations in a Map

MapReduce-Based Computation of Area Skyline Query for Selecting Good Locations in a Map DEIM Forum 2018 A3-2 MapReduce-Based Computation of Area Skyline Query for Selecting Good Locations in a Map Chen LI, Annisa, Asif ZAMAN, and Yasuhiko MORIMOTO Graduate School of Engineering, Hiroshima

More information

Eliciting Matters Controlling Skyline Sizes by Incremental Integration of User Preferences

Eliciting Matters Controlling Skyline Sizes by Incremental Integration of User Preferences Eliciting Matters Controlling Skyline Sizes by Incremental Integration of User Preferences Wolf-Tilo Balke 1, Ulrich Güntzer 2, Christoph Lofi 1 1 L3S Research Center, Leibniz University Hannover Appelstr

More information

Leveraging Transitive Relations for Crowdsourced Joins*

Leveraging Transitive Relations for Crowdsourced Joins* Leveraging Transitive Relations for Crowdsourced Joins* Jiannan Wang #, Guoliang Li #, Tim Kraska, Michael J. Franklin, Jianhua Feng # # Department of Computer Science, Tsinghua University, Brown University,

More information

Distributed Skyline Processing: a Trend in Database Research Still Going Strong

Distributed Skyline Processing: a Trend in Database Research Still Going Strong Distributed Skyline Processing: a Trend in Database Research Still Going Strong Katja Hose Max-Planck Institute for Informatics Saarbrücken, Germany Akrivi Vlachou Norwegian University of Science and Technology,

More information

VANET Based Adaptive Traffic Signal Control

VANET Based Adaptive Traffic Signal Control VANET Based Adaptive Traffic Signal Control N.Priya Assistant Professor, Ramanujam Centre For Computational Intelligence, Department of Computer Science And Engineering, Bharath University, Chennai,Tamilnadu,

More information

Leveraging Set Relations in Exact Set Similarity Join

Leveraging Set Relations in Exact Set Similarity Join Leveraging Set Relations in Exact Set Similarity Join Xubo Wang, Lu Qin, Xuemin Lin, Ying Zhang, and Lijun Chang University of New South Wales, Australia University of Technology Sydney, Australia {xwang,lxue,ljchang}@cse.unsw.edu.au,

More information

Efficient Parallel Skyline Processing using Hyperplane Projections

Efficient Parallel Skyline Processing using Hyperplane Projections Efficient Parallel Skyline Processing using Hyperplane Projections Henning Köhler henning@itee.uq.edu.au Jing Yang 2 jingyang@ruc.edu.cn Xiaofang Zhou,2 zxf@uq.edu.au School of Information Technology and

More information

SkyDB: Skyline Aware Query Evaluation Framework

SkyDB: Skyline Aware Query Evaluation Framework SkyDB: Skyline Aware Query Evaluation Framework Venkatesh Raghavan 1, Advisor: Elke A. Rundensteiner 2 Department of Computer Science, Worcester Polytechnic Institute, Worcester MA, USA { 1 venky, 2 rundenst}@cs.wpi.edu

More information

SKYLINE QUERIES FOR MULTI-CRITERIA DECISION SUPPORT SYSTEMS SATYAVEER GOUD GUDALA. B.E., Osmania University, 2009 A REPORT

SKYLINE QUERIES FOR MULTI-CRITERIA DECISION SUPPORT SYSTEMS SATYAVEER GOUD GUDALA. B.E., Osmania University, 2009 A REPORT SKYLINE QUERIES FOR MULTI-CRITERIA DECISION SUPPORT SYSTEMS by SATYAVEER GOUD GUDALA B.E., Osmania University, 2009 A REPORT submitted in partial fulfillment of the requirements for the degree MASTER OF

More information

Flexible and Efficient Resolution of Skyline Query Size Constraints

Flexible and Efficient Resolution of Skyline Query Size Constraints 1 Flexible and Efficient Resolution of Syline Query Size Constraints Hua Lu, Member, IEEE, Christian S. Jensen, Fellow, IEEE Zhenjie Zhang Student Member, IEEE Abstract Given a set of multi-dimensional

More information

3 No-Wait Job Shops with Variable Processing Times

3 No-Wait Job Shops with Variable Processing Times 3 No-Wait Job Shops with Variable Processing Times In this chapter we assume that, on top of the classical no-wait job shop setting, we are given a set of processing times for each operation. We may select

More information

Selecting Stars: The k Most Representative Skyline Operator

Selecting Stars: The k Most Representative Skyline Operator Selecting Stars: The k Most Representative Skyline Operator Xuemin Lin Yidong Yuan Qing Zhang Ying Zhang School of Computer Science and Engineering E-Health Research Center The University of New South

More information

Efficient Sort-Based Skyline Evaluation

Efficient Sort-Based Skyline Evaluation Efficient Sort-Based Skyline Evaluation ILARIA BARTOLINI, PAOLO CIACCIA, and MARCO PATELLA Alma Mater Studiorum Università di Bologna Skyline queries compute the set of Pareto-optimal tuples in a relation,

More information

Progressive Skylining over Web-Accessible Database

Progressive Skylining over Web-Accessible Database Progressive Skylining over Web-Accessible Database Eric Lo a Kevin Yip a King-Ip Lin b David W. Cheung a a Department of Computer Science, The University of Hong Kong b Division of Computer Science, The

More information

Logical Foundations of Preference Queries

Logical Foundations of Preference Queries Logical Foundations of Preference Queries Jan Chomicki University at Buffalo chomicki@buffalo.edu Abstract The notion of preference plays an increasing role in today s information systems. In particular,

More information

The Encoding Complexity of Network Coding

The Encoding Complexity of Network Coding The Encoding Complexity of Network Coding Michael Langberg Alexander Sprintson Jehoshua Bruck California Institute of Technology Email: mikel,spalex,bruck @caltech.edu Abstract In the multicast network

More information

Continuous Processing of Preference Queries in Data Streams

Continuous Processing of Preference Queries in Data Streams Continuous Processing of Preference Queries in Data Streams Maria Kontaki, Apostolos N. Papadopoulos, and Yannis Manolopoulos Department of Informatics, Aristotle University 54124 Thessaloniki, Greece

More information

BSkyTree: Scalable Skyline Computation Using A Balanced Pivot Selection

BSkyTree: Scalable Skyline Computation Using A Balanced Pivot Selection BSkyTree: Scalable Skyline Computation Using A Pivot Selection Jongwuk Lee, Seung-won Hwang Department of Computer Science and Engineering Pohang University of Science and Technology (POSTECH) Pohang,

More information

Processing Rank-Aware Queries in P2P Systems

Processing Rank-Aware Queries in P2P Systems Processing Rank-Aware Queries in P2P Systems Katja Hose, Marcel Karnstedt, Anke Koch, Kai-Uwe Sattler, and Daniel Zinn Department of Computer Science and Automation, TU Ilmenau P.O. Box 100565, D-98684

More information

Semantic Optimization of Preference Queries

Semantic Optimization of Preference Queries Semantic Optimization of Preference Queries Jan Chomicki University at Buffalo http://www.cse.buffalo.edu/ chomicki 1 Querying with Preferences Find the best answers to a query, instead of all the answers.

More information

Skyline Ranking à la IR

Skyline Ranking à la IR Skyline Ranking à la IR George Valkanas Dept. of Informatics and Telecommunications University of Athens Athens, Greece gvalk@di.uoa.gr Apostolos N. Papadopoulos Dept. of Informatics Aristotle University

More information

Efficient Service Selection in Mobile Information Systems

Efficient Service Selection in Mobile Information Systems Efficient Service Selection in Mobile Information Systems Shangguang WANG, a,1, Lei SUN a, Qibo SUN a, Jinlin LI a and Fangchun YANG a a State Key Laboratory of Networking and Switching Technology, Beijing

More information

Skyline Diagram: Finding the Voronoi Counterpart for Skyline Queries

Skyline Diagram: Finding the Voronoi Counterpart for Skyline Queries Skyline Diagram: Finding the Voronoi Counterpart for Skyline Queries Jinfei Liu, Juncheng Yang, Li Xiong, Jian Pei, Jun Luo Department of Mathematics & Computer Science, Emory University {jinfei.liu, juncheng.yang,

More information

Top-k Keyword Search Over Graphs Based On Backward Search

Top-k Keyword Search Over Graphs Based On Backward Search Top-k Keyword Search Over Graphs Based On Backward Search Jia-Hui Zeng, Jiu-Ming Huang, Shu-Qiang Yang 1College of Computer National University of Defense Technology, Changsha, China 2College of Computer

More information

Lecture 15: The subspace topology, Closed sets

Lecture 15: The subspace topology, Closed sets Lecture 15: The subspace topology, Closed sets 1 The Subspace Topology Definition 1.1. Let (X, T) be a topological space with topology T. subset of X, the collection If Y is a T Y = {Y U U T} is a topology

More information

QoS-Driven Service Selection for Multi-Tenant SaaS

QoS-Driven Service Selection for Multi-Tenant SaaS 202 IEEE Fifth International Conference on Cloud Computing QoS-Driven Service Selection for Multi-Tenant SaaS Qiang He, Jun Han, Yun Yang and John Grundy Faulty of Information and Communication Technologies

More information

International Journal of Advanced Research in Computer Science and Software Engineering

International Journal of Advanced Research in Computer Science and Software Engineering Volume 3, Issue 4, April 2013 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Performance View

More information

Queue Theory based Response Time Analyses for Geo-Information Processing Chain

Queue Theory based Response Time Analyses for Geo-Information Processing Chain Queue Theory based Response Time Analyses for Geo-Information Processing Chain Jie Chen, Jian Peng, Min Deng, Chao Tao, Haifeng Li a School of Civil Engineering, School of Geosciences Info-Physics, Central

More information

Processing Skyline Queries in Temporal Databases

Processing Skyline Queries in Temporal Databases Processing Skyline Queries in Temporal Databases Christos Kalyvas Department of Information and Communication Systems Engineering, University of the Aegean, Samos, Greece chkalyvas@aegean.gr Theodoros

More information

Maintenance of the Prelarge Trees for Record Deletion

Maintenance of the Prelarge Trees for Record Deletion 12th WSEAS Int. Conf. on APPLIED MATHEMATICS, Cairo, Egypt, December 29-31, 2007 105 Maintenance of the Prelarge Trees for Record Deletion Chun-Wei Lin, Tzung-Pei Hong, and Wen-Hsiang Lu Department of

More information

Web Service Discovery with Implicit QoS Filtering

Web Service Discovery with Implicit QoS Filtering Web Service Discovery with Implicit QoS Filtering Natallia Kokash DIT - University of Trento, Via Sommarive, 14, 38050 Trento, Italy email: natallia.kokash@dit.unitn.it Abstract. Web Service (WS) discovery

More information

Shooting Stars in the Sky: An Online Algorithm for Skyline Queries

Shooting Stars in the Sky: An Online Algorithm for Skyline Queries Shooting Stars in the Sky: An Online Algorithm for Skyline Queries Donald Kossmann Frank Ramsak Steffen Rost Technische Universität München Orleansstr. 34 81667 Munich Germany {kossmann, rost}@in.tum.de,

More information

Enhancing Web Service Selection by User Preferences of Non-Functional Features

Enhancing Web Service Selection by User Preferences of Non-Functional Features Enhancing Web Service Selection by User Preferences of Non-Functional Features Youakim Badr, Ajith Abraham, Frédérique Biennier and Crina Grosan* National Institute of Applied Sciences of Lyon, INSA-Lyon,

More information

Topic: Local Search: Max-Cut, Facility Location Date: 2/13/2007

Topic: Local Search: Max-Cut, Facility Location Date: 2/13/2007 CS880: Approximations Algorithms Scribe: Chi Man Liu Lecturer: Shuchi Chawla Topic: Local Search: Max-Cut, Facility Location Date: 2/3/2007 In previous lectures we saw how dynamic programming could be

More information

Location-Aware Web Service Recommendation Using Personalized Collaborative Filtering

Location-Aware Web Service Recommendation Using Personalized Collaborative Filtering ISSN 2395-1621 Location-Aware Web Service Recommendation Using Personalized Collaborative Filtering #1 Shweta A. Bhalerao, #2 Prof. R. N. Phursule 1 Shweta.bhalerao75@gmail.com 2 rphursule@gmail.com #12

More information

Dominant Graph: An Efficient Indexing Structure to Answer Top-K Queries

Dominant Graph: An Efficient Indexing Structure to Answer Top-K Queries Dominant Graph: An Efficient Indexing Structure to Answer Top-K Queries Lei Zou 1, Lei Chen 2 1 Huazhong University of Science and Technology 137 Luoyu Road, Wuhan, P. R. China 1 zoulei@mail.hust.edu.cn

More information

Clustering Technique with Potter stemmer and Hypergraph Algorithms for Multi-featured Query Processing

Clustering Technique with Potter stemmer and Hypergraph Algorithms for Multi-featured Query Processing Vol.2, Issue.3, May-June 2012 pp-960-965 ISSN: 2249-6645 Clustering Technique with Potter stemmer and Hypergraph Algorithms for Multi-featured Query Processing Abstract In navigational system, it is important

More information

SA-IFIM: Incrementally Mining Frequent Itemsets in Update Distorted Databases

SA-IFIM: Incrementally Mining Frequent Itemsets in Update Distorted Databases SA-IFIM: Incrementally Mining Frequent Itemsets in Update Distorted Databases Jinlong Wang, Congfu Xu, Hongwei Dan, and Yunhe Pan Institute of Artificial Intelligence, Zhejiang University Hangzhou, 310027,

More information

A New Hybrid Algorithm for the Multiple-Choice Multi-Dimensional Knapsack Problem

A New Hybrid Algorithm for the Multiple-Choice Multi-Dimensional Knapsack Problem A New Hybrid Algorithm for the Multiple-Choice Multi-Dimensional Knapsack Problem MAHMOUD ZENNAKI Computer science department, faculty of mathematics and computer science University of Science and Technology

More information

CS 598CSC: Approximation Algorithms Lecture date: March 2, 2011 Instructor: Chandra Chekuri

CS 598CSC: Approximation Algorithms Lecture date: March 2, 2011 Instructor: Chandra Chekuri CS 598CSC: Approximation Algorithms Lecture date: March, 011 Instructor: Chandra Chekuri Scribe: CC Local search is a powerful and widely used heuristic method (with various extensions). In this lecture

More information

arxiv: v1 [cs.db] 18 Mar 2009

arxiv: v1 [cs.db] 18 Mar 2009 Spatial Skyline Queries: An Efficient Geometric Algorithm Wanbin Son, Mu-Woong Lee, Hee-Kap Ahn, and Seung-won Hwang arxiv:0903.3072v1 [cs.db] 18 Mar 2009 Pohang University of Science and Technology, Korea

More information

Multi-objective Query Processing for Database Systems

Multi-objective Query Processing for Database Systems Multi-objective Query Processing for Database Systems Wolf-Tilo Balke Computer Science Department University of California Berkeley, CA, USA balke@eecs.berkeley.edu Abstract Query processing in database

More information

QoS Management of Web Services

QoS Management of Web Services QoS Management of Web Services Zibin Zheng (Ben) Supervisor: Prof. Michael R. Lyu Department of Computer Science & Engineering The Chinese University of Hong Kong Dec. 10, 2010 Outline Introduction Web

More information

Web page recommendation using a stochastic process model

Web page recommendation using a stochastic process model Data Mining VII: Data, Text and Web Mining and their Business Applications 233 Web page recommendation using a stochastic process model B. J. Park 1, W. Choi 1 & S. H. Noh 2 1 Computer Science Department,

More information

Monotone Paths in Geometric Triangulations

Monotone Paths in Geometric Triangulations Monotone Paths in Geometric Triangulations Adrian Dumitrescu Ritankar Mandal Csaba D. Tóth November 19, 2017 Abstract (I) We prove that the (maximum) number of monotone paths in a geometric triangulation

More information

Convex hulls of spheres and convex hulls of convex polytopes lying on parallel hyperplanes

Convex hulls of spheres and convex hulls of convex polytopes lying on parallel hyperplanes Convex hulls of spheres and convex hulls of convex polytopes lying on parallel hyperplanes Menelaos I. Karavelas joint work with Eleni Tzanaki University of Crete & FO.R.T.H. OrbiCG/ Workshop on Computational

More information

Efficient Retrieval of Web Services Using Prioritization and Clustering

Efficient Retrieval of Web Services Using Prioritization and Clustering Efficient Retrieval of Web Services Using Prioritization and Clustering A.Aroj Prasad * B.Meena B.Udaya Kumar V.Kartheek Department of Information Technology, ANITS, Andhra Pradesh, India. *E-mail: arojprasad@gmail.com

More information

Computing Continuous Skyline Queries without Discriminating between Static and Dynamic Attributes

Computing Continuous Skyline Queries without Discriminating between Static and Dynamic Attributes Computing Continuous Skyline Queries without Discriminating between Static and Dynamic Attributes Ibrahim Gomaa, Hoda M. O. Mokhtar Abstract Although most of the existing skyline queries algorithms focused

More information

Integer Programming Theory

Integer Programming Theory Integer Programming Theory Laura Galli October 24, 2016 In the following we assume all functions are linear, hence we often drop the term linear. In discrete optimization, we seek to find a solution x

More information

Published by: PIONEER RESEARCH & DEVELOPMENT GROUP ( 1

Published by: PIONEER RESEARCH & DEVELOPMENT GROUP (  1 User Preferences Based Automatic Web Service Composition K.Purshothaman 1, S.K.Ram Prasath 2, Ramya Ramprasad 3 1, 2, 3 Department of Information Technology, Anand Institute of Higher Technology, Chennai,

More information

Similarity Search: A Matching Based Approach

Similarity Search: A Matching Based Approach Similarity Search: A Matching Based Approach Anthony K. H. Tung Rui Zhang Nick Koudas Beng Chin Ooi National Univ. of Singapore Univ. of Melbourne Univ. of Toronto {atung, ooibc}@comp.nus.edu.sg rui@csse.unimelb.edu.au

More information

12.1 Formulation of General Perfect Matching

12.1 Formulation of General Perfect Matching CSC5160: Combinatorial Optimization and Approximation Algorithms Topic: Perfect Matching Polytope Date: 22/02/2008 Lecturer: Lap Chi Lau Scribe: Yuk Hei Chan, Ling Ding and Xiaobing Wu In this lecture,

More information

The Fibonacci hypercube

The Fibonacci hypercube AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 40 (2008), Pages 187 196 The Fibonacci hypercube Fred J. Rispoli Department of Mathematics and Computer Science Dowling College, Oakdale, NY 11769 U.S.A. Steven

More information

Which Are My Preferred Items?

Which Are My Preferred Items? Which Are My Preferred Items? Riccardo Torlone 1 and Paolo Ciaccia 2 1 Dip. di Informatica e Automazione Università RomaTre ViadellaVascaNavale,79 00146 Roma, Italy torlone@dia.uniroma3.it 2 DEIS CSITE

More information

Parameterized Complexity of Independence and Domination on Geometric Graphs

Parameterized Complexity of Independence and Domination on Geometric Graphs Parameterized Complexity of Independence and Domination on Geometric Graphs Dániel Marx Institut für Informatik, Humboldt-Universität zu Berlin, Unter den Linden 6, 10099 Berlin, Germany. dmarx@informatik.hu-berlin.de

More information

AC-Close: Efficiently Mining Approximate Closed Itemsets by Core Pattern Recovery

AC-Close: Efficiently Mining Approximate Closed Itemsets by Core Pattern Recovery : Efficiently Mining Approximate Closed Itemsets by Core Pattern Recovery Hong Cheng Philip S. Yu Jiawei Han University of Illinois at Urbana-Champaign IBM T. J. Watson Research Center {hcheng3, hanj}@cs.uiuc.edu,

More information

Top-K Ranking Spatial Queries over Filtering Data

Top-K Ranking Spatial Queries over Filtering Data Top-K Ranking Spatial Queries over Filtering Data 1 Lakkapragada Prasanth, 2 Krishna Chaitanya, 1 Student, 2 Assistant Professor, NRL Instiute of Technology,Vijayawada Abstract: A spatial preference query

More information

Fast Algorithm of Pareto Optimal Group-based Skyline

Fast Algorithm of Pareto Optimal Group-based Skyline Fast Algorithm of Pareto Optimal Group-based Skyline Wenhui Yu Tsinghua University Beijing, China yuwh16@mails.tsinghua.edu.cn Zheng Qin Tsinghua University Beijing, China qingzh@mail.tsinghua.edu.cn Jinfei

More information

Combining Review Text Content and Reviewer-Item Rating Matrix to Predict Review Rating

Combining Review Text Content and Reviewer-Item Rating Matrix to Predict Review Rating Combining Review Text Content and Reviewer-Item Rating Matrix to Predict Review Rating Dipak J Kakade, Nilesh P Sable Department of Computer Engineering, JSPM S Imperial College of Engg. And Research,

More information

Mining High Average-Utility Itemsets

Mining High Average-Utility Itemsets Proceedings of the 2009 IEEE International Conference on Systems, Man, and Cybernetics San Antonio, TX, USA - October 2009 Mining High Itemsets Tzung-Pei Hong Dept of Computer Science and Information Engineering

More information

Top-k Dominant Web Services Under Multi-Criteria Matching

Top-k Dominant Web Services Under Multi-Criteria Matching Top-k Dominant Web Services Under Multi-Criteria Matching Dimitrios Skoutas 1,2 Dimitris Sacharidis 1 Alkis Simitsis 3 Verena Kantere 4 Timos Sellis 2,1 1 National Technical University of Athens, Greece

More information

Mining Temporal Indirect Associations

Mining Temporal Indirect Associations Mining Temporal Indirect Associations Ling Chen 1,2, Sourav S. Bhowmick 1, Jinyan Li 2 1 School of Computer Engineering, Nanyang Technological University, Singapore, 639798 2 Institute for Infocomm Research,

More information

Theorem 2.9: nearest addition algorithm

Theorem 2.9: nearest addition algorithm There are severe limits on our ability to compute near-optimal tours It is NP-complete to decide whether a given undirected =(,)has a Hamiltonian cycle An approximation algorithm for the TSP can be used

More information

Comparative Study of Subspace Clustering Algorithms

Comparative Study of Subspace Clustering Algorithms Comparative Study of Subspace Clustering Algorithms S.Chitra Nayagam, Asst Prof., Dept of Computer Applications, Don Bosco College, Panjim, Goa. Abstract-A cluster is a collection of data objects that

More information