Results 131 to 140 of about 1,381,457 (160)
Some of the next articles are maybe not open access.
2010 IEEE 26th International Conference on Data Engineering Workshops (ICDEW 2010), 2010
In the context of service composition and orchestration, service invocation is typically scheduled according to execution plans, whose topology establishes whether different services are to be invoked in parallel or in a sequence. In the latter case, we may have a configuration, called pipe join, in which the output of a service is used as input for ...
MARTINENGHI, DAVIDE, TAGLIASACCHI, MARCO
openaire +2 more sources
In the context of service composition and orchestration, service invocation is typically scheduled according to execution plans, whose topology establishes whether different services are to be invoked in parallel or in a sequence. In the latter case, we may have a configuration, called pipe join, in which the output of a service is used as input for ...
MARTINENGHI, DAVIDE, TAGLIASACCHI, MARCO
openaire +2 more sources
Metrika, 2006
Top-k-lists are introduced as sequences of k-dimensional random vectors with ordered components being k largest observations from a sequence of independent identically distributed random variables. Such lists changing in time are natural stochastic models of ranking tables which appear in many situations in real life, when one wants to keep a track of ...
Fernando López-Blázquez +1 more
openaire +1 more source
Top-k-lists are introduced as sequences of k-dimensional random vectors with ordered components being k largest observations from a sequence of independent identically distributed random variables. Such lists changing in time are natural stochastic models of ranking tables which appear in many situations in real life, when one wants to keep a track of ...
Fernando López-Blázquez +1 more
openaire +1 more source
Top-k Manhattan spatial skyline queries
Information Processing Letters, 2014zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Son, W. +3 more
openaire +3 more sources
Mining Top-K Multidimensional Gradients
2007Several business applications such as marketing basket analysis, clickstream analysis, fraud detection and churning migration analysis demand gradient data analysis. By employing gradient data analysis one is able to identify trends, outliers and answering "what-if" questions over large databases. Gradient queries were first introduced by Imielinski et
Alves, Ronnie +2 more
openaire +3 more sources
2012
Recently there has been an increased interest in database management systems to incorporate and support more flexible query operators, such as top-k, that produce results of specified cardinality, thus avoiding huge and overwhelming result sets. Top-k queries retrieve the objects that best match the user requirements by employing user-specified scoring
Akrivi Vlachou +3 more
openaire +1 more source
Recently there has been an increased interest in database management systems to incorporate and support more flexible query operators, such as top-k, that produce results of specified cardinality, thus avoiding huge and overwhelming result sets. Top-k queries retrieve the objects that best match the user requirements by employing user-specified scoring
Akrivi Vlachou +3 more
openaire +1 more source
IEEE Transactions on Knowledge and Data Engineering, 2005
Given two spatial data sets A and B, a top-k spatial join retrieves the k objects from A or B that intersect the largest number of objects from the other data set. Depending on the application requirements, there exist several variations of the problem.
Zhu, Manli +3 more
openaire +2 more sources
Given two spatial data sets A and B, a top-k spatial join retrieves the k objects from A or B that intersect the largest number of objects from the other data set. Depending on the application requirements, there exist several variations of the problem.
Zhu, Manli +3 more
openaire +2 more sources
2010 IEEE 26th International Conference on Data Engineering (ICDE 2010), 2010
Rank-aware query processing has become essential for many applications that return to the user only the top-k objects based on the individual user's preferences. Top-k queries have been mainly studied from the perspective of the user, focusing primarily on efficient query processing.
Akrivi Vlachou +3 more
openaire +1 more source
Rank-aware query processing has become essential for many applications that return to the user only the top-k objects based on the individual user's preferences. Top-k queries have been mainly studied from the perspective of the user, focusing primarily on efficient query processing.
Akrivi Vlachou +3 more
openaire +1 more source
2020
This chapter focuses on continuously finding the most relevant (shortly, top-k) answer of a query that joins streaming and distributed data. Remaining reactive can be challenging, when accessing the distributed data has high latency and is rate limited.
Shima Zahmatkesh, Emanuele Della Valle
openaire +1 more source
This chapter focuses on continuously finding the most relevant (shortly, top-k) answer of a query that joins streaming and distributed data. Remaining reactive can be challenging, when accessing the distributed data has high latency and is rate limited.
Shima Zahmatkesh, Emanuele Della Valle
openaire +1 more source
2012 IEEE 13th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC), 2012
Many distributed signal processing problems involve aggregating vectors of data, and often we are interested in the largest entries of the aggregate vector. For example, in distributed particle filtering one may be interested in fusing information about particles with the largest weights.
Deniz Ustebay, Michael Rabbat
openaire +1 more source
Many distributed signal processing problems involve aggregating vectors of data, and often we are interested in the largest entries of the aggregate vector. For example, in distributed particle filtering one may be interested in fusing information about particles with the largest weights.
Deniz Ustebay, Michael Rabbat
openaire +1 more source
Proceedings of the VLDB Endowment, 2016
Crowdsourced top-k computation has attracted significant attention recently, thanks to emerging crowdsourcing platforms, e.g., Amazon Mechanical Turk and CrowdFlower. Crowdsourced top-k algorithms ask the crowd to compare the objects and infer the top-k objects based ...
Xiaohang Zhang +2 more
openaire +1 more source
Crowdsourced top-k computation has attracted significant attention recently, thanks to emerging crowdsourcing platforms, e.g., Amazon Mechanical Turk and CrowdFlower. Crowdsourced top-k algorithms ask the crowd to compare the objects and infer the top-k objects based ...
Xiaohang Zhang +2 more
openaire +1 more source