Sciweavers

14 search results - page 2 / 3
» Top-k pipe join
Sort
View
ICDE
2010
IEEE
428views Database» more  ICDE 2010»
14 years 5 months ago
Supporting Top-K Keyword Search in XML Databases
Keyword search is considered to be an effective information discovery method for both structured and semistructured data. In XML keyword search, query semantics is based on the con...
Liang Jeff Chen, Yannis Papakonstantinou
ICDE
2010
IEEE
240views Database» more  ICDE 2010»
13 years 9 months ago
Top-K aggregation queries over large networks
Searching and mining large graphs today is critical to a variety of application domains, ranging from personalized recommendation in social networks, to searches for functional ass...
Xifeng Yan, Bin He, Feida Zhu, Jiawei Han
ICDE
2010
IEEE
167views Database» more  ICDE 2010»
13 years 5 months ago
Top-k pipe join
Abstract—In the context of service composition and orchestration, service invocation is typically scheduled according to execution plans, whose topology establishes whether diffe...
Davide Martinenghi, Marco Tagliasacchi
PODS
2008
ACM
123views Database» more  PODS 2008»
14 years 5 months ago
Evaluating rank joins with optimal cost
In the rank join problem, we are given a set of relations and a scoring function, and the goal is to return the join results with the top K scores. It is often the case in practic...
Karl Schnaitter, Neoklis Polyzotis
DMSN
2005
ACM
13 years 7 months ago
The threshold join algorithm for top-k queries in distributed sensor networks
In this paper we present the Threshold Join Algorithm (TJA), which is an efficient TOP-k query processing algorithm for distributed sensor networks. The objective of a top-k query...
Demetrios Zeinalipour-Yazti, Zografoula Vagena, Di...