Sciweavers

116 search results - page 2 / 24
» Privacy-Preserving Top-K Queries
Sort
View
SSDBM
2005
IEEE
184views Database» more  SSDBM 2005»
15 years 11 months ago
Optimizing Multiple Top-K Queries over Joins
Advanced Data Mining applications require more and more support from relational database engines. Especially clustering applications in high dimensional features space demand a pr...
Dirk Habich, Wolfgang Lehner, Alexander Hinneburg
CORR
2010
Springer
135views Education» more  CORR 2010»
15 years 15 days ago
Top-K Color Queries for Document Retrieval
In this paper we describe a new efficient (in fact optimal) data structure for the top-K color problem. Each element of an array A is assigned a color c with priority p(c). For a ...
Marek Karpinski, Yakov Nekrich
VLDB
2008
ACM
206views Database» more  VLDB 2008»
16 years 5 months ago
TopX: efficient and versatile top- k query processing for semistructured data
Recent IR extensions to XML query languages
Martin Theobald, Holger Bast, Debapriyo Majumdar, ...
163
Voted
COOPIS
2002
IEEE
15 years 10 months ago
On Real-Time Top k Querying for Mobile Services
Mobile services offering multi-feature query capabilities must meet tough response time requirements to gain customer acceptance. The top-k query model is a popular candidate to im...
Wolf-Tilo Balke, Ulrich Güntzer, Werner Kie&s...
PVLDB
2010
140views more  PVLDB 2010»
15 years 3 months ago
Optimal Top-K Query Evaluation for Weighted Business Processes
A Business Process (BP for short) consists of a set of activities that achieve some business goal when combined in a flow. Among all the (maybe infinitely many) possible executi...
Daniel Deutch, Tova Milo, Neoklis Polyzotis, Tom Y...