Sciweavers

116 search results - page 19 / 24
» Privacy-Preserving Top-K Queries
Sort
View
SIGMOD
2011
ACM
234views Database» more  SIGMOD 2011»
13 years 13 days ago
Ranking with uncertain scoring functions: semantics and sensitivity measures
Ranking queries report the top-K results according to a user-defined scoring function. A widely used scoring function is the weighted summation of multiple scores. Often times, u...
Mohamed A. Soliman, Ihab F. Ilyas, Davide Martinen...
VLDB
2004
ACM
161views Database» more  VLDB 2004»
14 years 9 months ago
Supporting top-k join queries in relational databases
Ranking queries produce results that are ordered on some computed score. Typically, these queries involve joins, where users are usually interested only in the top-k join results....
Ihab F. Ilyas, Walid G. Aref, Ahmed K. Elmagarmid
EDBT
2009
ACM
208views Database» more  EDBT 2009»
14 years 4 months ago
Flexible and efficient querying and ranking on hyperlinked data sources
There has been an explosion of hyperlinked data in many domains, e.g., the biological Web. Expressive query languages and effective ranking techniques are required to convert this...
Ramakrishna Varadarajan, Vagelis Hristidis, Louiqa...
EDBT
2002
ACM
246views Database» more  EDBT 2002»
14 years 9 months ago
Impact and Potential of User Profiles Used for Distributed Query Processing Based on Literature Services
Applying meta search systems is a suitable method to support the user if there are many different services. Due to information splitting strategies of literature services existing ...
Bethina Schmitt
EDBT
2011
ACM
209views Database» more  EDBT 2011»
13 years 1 months ago
An optimal strategy for monitoring top-k queries in streaming windows
Continuous top-k queries, which report a certain number (k) of top preferred objects from data streams, are important for a broad class of real-time applications, ranging from fi...
Di Yang, Avani Shastri, Elke A. Rundensteiner, Mat...