627 search results - page 93 / 126 » Efficient Top-k Query Evaluation on Probabilistic Data |
170
click to vote
ASUNAM
2010
IEEE
15 years 7 months ago
2010
IEEE
Subgraph matching is a key operation on graph data. Social network (SN) providers may want to find all subgraphs within their social network that "match" certain query gr...
165
click to vote
AUSAI
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Mobile devices get to handle much information thanks to the convergence of diverse functionalities. Their environment has great potential of supporting customized service...
388
click to vote
SIGMOD
2006
ACM
16 years 6 months ago
2006
ACM
Given a dataset P and a preference function f, a top-k query retrieves the k tuples in P with the highest scores according to f. Even though the problem is well-studied in convent...
286
click to vote
VLDB
2006
ACM
16 years 6 months ago
2006
ACM
Abstract Traditional nearest-neighbor (NN) search is based on two basic indexing approaches: object-based indexing and solution-based indexing. The former is constructed based on t...
156
click to vote
EDBT
2006
ACM
16 years 6 months ago
2006
ACM
Similarity search in time series data is required in many application fields. The most prominent work has focused on similarity search considering either complete time series or si...