Author of the publication

Answering Top-k Queries over Outsourced Sensitive Data in the Cloud.

, , and . DEXA (1), volume 11029 of Lecture Notes in Computer Science, page 218-231. Springer, (2018)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Top-k Query Processing over Distributed Sensitive Data., , and . IDEAS, page 208-216. ACM, (2018)Privacy-Preserving Top-k Query Processing in Distributed Systems., , and . Euro-Par, volume 11014 of Lecture Notes in Computer Science, page 281-292. Springer, (2018)Subset Modelling: A Domain Partitioning Strategy for Data-efficient Machine-Learning., , , , , , , and . SBBD, page 318-323. SBC, (2023)Efficient Evaluation of SUM Queries over Probabilistic Data., , and . IEEE Trans. Knowl. Data Eng., 25 (4): 764-775 (2013)Best position algorithms for efficient top-k query processing., , and . Inf. Syst., 36 (6): 973-989 (2011)Parallel Streaming Implementation of Online Time Series Correlation Discovery on Sliding Windows with Regression Capabilities., , , , , , and . CLOSER, page 681-687. SciTePress, (2019)NACluster: A Non-supervised Clustering Algorithm for Matching Multi Catalogues., , , and . eScience Workshops, page 83-86. IEEE, (2014)978-1-4799-4288-6.Spark-parSketch: A Massively Distributed Indexing of Time Series Datasets., , , , , and . CIKM, page 1951-1954. ACM, (2018)Processing Top-k Queries in Distributed Hash Tables., , and . Euro-Par, volume 4641 of Lecture Notes in Computer Science, page 489-502. Springer, (2007)Efficient Early Top-k Query Processing in Overloaded P2P Systems., , , and . DEXA (1), volume 6860 of Lecture Notes in Computer Science, page 140-155. Springer, (2011)