Author image not provided
 Paraschos Koutris

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article8.83
Citation Count203
Publication count23
Publication years2011-2017
Available for download18
Average downloads per article229.94
Downloads (cumulative)4,139
Downloads (12 Months)1,213
Downloads (6 Weeks)147
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


23 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 20 of 23
Result page: 1 2

Sort by:

1 published by ACM
October 2017 Journal of the ACM (JACM): Volume 64 Issue 6, November 2017
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 30,   Downloads (12 Months): 97,   Downloads (Overall): 97

Full text available: PDFPDF
We study the problem of computing conjunctive queries over large databases on parallel architectures without shared storage. Using the structure of such a query q and the skew in the data, we study tradeoffs between the number of processors, the number of rounds of communication, and the per-processor load —the ...
Keywords: Parallel computation, lower bounds

2
August 2017 Proceedings of the VLDB Endowment: Volume 10 Issue 12, August 2017
Publisher: VLDB Endowment
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 1,   Downloads (12 Months): 9,   Downloads (Overall): 9

Full text available: PDFPDF
The last decade has seen a deluge in data collection and dissemination across a broad range of areas. This phenomena has led to creation of online data markets where entities engage in sale and purchase of data. In this scenario, the key challenge for the data market platform is to ...

3
July 2017 Theory of Computing Systems: Volume 61 Issue 1, July 2017
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

In this paper, we study the complexity of answering conjunctive queries (CQ) with inequalities (ź). In particular, we are interested in comparing the complexity of the query with and without inequalities. The main contribution of our work is a novel combinatorial technique that enables us to use any Select-Project-Join query ...
Keywords: Inequality, Treewidth, Conjunctive query, Query evaluation

4 published by ACM
June 2017 ACM Transactions on Database Systems (TODS) - Invited Paper from SIGMOD 2015, Invited Paper from PODS 2015 and Regular Papers: Volume 42 Issue 2, June 2017
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 19,   Downloads (12 Months): 101,   Downloads (Overall): 101

Full text available: PDFPDF
A relational database is said to be uncertain if primary key constraints can possibly be violated. A repair (or possible world) of an uncertain database is obtained by selecting a maximal number of tuples without ever selecting two distinct tuples with the same primary key value. For any Boolean query ...
Keywords: Attack graph, complexity dichotomy, consistent query answering, conjunctive queries, primary keys

5 published by ACM
May 2017 DEEM'17: Proceedings of the 1st Workshop on Data Management for End-to-End Machine Learning
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 6,   Downloads (12 Months): 40,   Downloads (Overall): 40

Full text available: PDFPDF
While a lot of work has focused on improving the efficiency, scalability, and usability of machine learning (ML), little work has studied the cost of data acquisition for ML-based analytics. Datasets are already being bought and sold in marketplaces for various tasks, including ML. But current marketplaces force users to ...

6 published by ACM
May 2017 ACM SIGMOD Record: Volume 45 Issue 4, December 2016
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 4,   Downloads (12 Months): 27,   Downloads (Overall): 27

Full text available: PDFPDF

7 published by ACM
May 2017 SIGMOD '17: Proceedings of the 2017 ACM International Conference on Management of Data
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 21,   Downloads (12 Months): 281,   Downloads (Overall): 281

Full text available: PDFPDF
Users are increasingly engaging in buying and selling data over the web. Facilitated by the proliferation of online marketplaces that bring such users together, data brokers need to serve requests where they provide results for user queries over the underlying datasets, and price them fairly according to the information disclosed ...
Keywords: query determinacy, data pricing, arbitrage

8
July 2016 Proceedings of the VLDB Endowment: Volume 9 Issue 11, July 2016
Publisher: VLDB Endowment
Bibliometrics:
Citation Count: 4
Downloads (6 Weeks): 12,   Downloads (12 Months): 75,   Downloads (Overall): 112

Full text available: PDFPDF
Data deduplication refers to the process of identifying tuples in a relation that refer to the same real world entity. The complexity of the problem is inherently quadratic with respect to the number of tuples, since a similarity value must be computed for every pair of tuples. To avoid comparing ...

9 published by ACM
June 2016 BeyondMR '16: Proceedings of the 3rd ACM SIGMOD Workshop on Algorithms and Systems for MapReduce and Beyond
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 1,   Downloads (12 Months): 33,   Downloads (Overall): 59

Full text available: PDFPDF
We study the problem of distributing the tuples of a relation to a number of processors organized in an r -dimensional hypercube, which is an important task for parallel join processing. In contrast to previous work, which proposed randomized algorithms for the task, we ask here the question of how ...

10 published by ACM
June 2016 ACM SIGMOD Record: Volume 45 Issue 1, March 2016
Publisher: ACM
Bibliometrics:
Citation Count: 3
Downloads (6 Weeks): 7,   Downloads (12 Months): 43,   Downloads (Overall): 71

Full text available: PDFPDF
We study the complexity of consistent query answering with respect to primary key violations, for self-join-free conjunctive queries. A repair of a possibly inconsistent database is obtained by selecting a maximal number of tuples without selecting two distinct tuples with the same primary key value. For any Boolean query q, ...

11 published by ACM
November 2015 Journal of the ACM (JACM): Volume 62 Issue 5, November 2015
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 19,   Downloads (12 Months): 181,   Downloads (Overall): 502

Full text available: PDFPDF
Data is increasingly being bought and sold online, and Web-based marketplace services have emerged to facilitate these activities. However, current mechanisms for pricing data are very simple: buyers can choose only from a set of explicit views, each with a specific price. In this article, we propose a framework for ...
Keywords: Data pricing, arbitrage, query determinacy

12
November 2015 Theory of Computing Systems: Volume 57 Issue 4, November 2015
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 3

In this paper, we design and analyze parallel algorithms for skyline queries. The skyline of a multidimensional set consists of the points for which no other point exists that is at least as good along every dimension. As a framework for parallel computation, we use both the MP model proposed ...
Keywords: Grid partitioning, Parallel computation, Skyline queries

13 published by ACM
May 2015 PODS '15: Proceedings of the 34th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems
Publisher: ACM
Bibliometrics:
Citation Count: 8
Downloads (6 Weeks): 3,   Downloads (12 Months): 20,   Downloads (Overall): 171

Full text available: PDFPDF
A relational database is said to be uncertain if primary key constraints can possibly be violated. A repair (or possible world) of an uncertain database is obtained by selecting a maximal number of tuples without ever selecting two distinct tuples with the same primary key value. For any Boolean query ...
Keywords: consistent query answering, conjunctive queries, primary keys

14 published by ACM
June 2014 PODS '14: Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Publisher: ACM
Bibliometrics:
Citation Count: 20
Downloads (6 Weeks): 7,   Downloads (12 Months): 79,   Downloads (Overall): 394

Full text available: PDFPDF
We study the problem of computing a conjunctive query q in parallel, using p of servers, on a large database. We consider algorithms with one round of communication, and study the complexity of the communication. We are especially interested in the case where the data is skewed, which is a ...
Keywords: lower bounds, parallel computation, skew

15 published by ACM
June 2014 SIGMOD '14: Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data
Publisher: ACM
Bibliometrics:
Citation Count: 22
Downloads (6 Weeks): 2,   Downloads (12 Months): 62,   Downloads (Overall): 394

Full text available: PDFPDF
In this demonstration, we will showcase Myria, our novel cloud service for big data management and analytics designed to improve productivity. Myria's goal is for users to simply upload their data and for the system to help them be self-sufficient data science experts on their data -- self-serve analytics. Using ...
Keywords: data management service, big data management, Myria

16 published by ACM
June 2013 PODS '13: Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGAI symposium on Principles of database systems
Publisher: ACM
Bibliometrics:
Citation Count: 37
Downloads (6 Weeks): 0,   Downloads (12 Months): 56,   Downloads (Overall): 337

Full text available: PDFPDF
We consider the problem of computing a relational query q on a large input database of size n , using a large number p of servers. The computation is performed in rounds , and each server can receive only O ( n/p 1-ε ) bits of data, where ε ∈[0,1] ...
Keywords: lower bounds, parallel computation

17 published by ACM
June 2013 SIGMOD '13: Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Publisher: ACM
Bibliometrics:
Citation Count: 7
Downloads (6 Weeks): 4,   Downloads (12 Months): 43,   Downloads (Overall): 290

Full text available: PDFPDF
We develop a new pricing system, QueryMarket, for flexible query pricing in a data market based on an earlier theoretical framework (Koutris et al., PODS 2012). To build such a system, we show how to use an Integer Linear Programming formulation of the pricing problem for a large class of ...
Keywords: data pricing, integer linear programming

18
September 2012 Datalog 2.0'12: Proceedings of the Second international conference on Datalog in Academia and Industry
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 5

We explore the design and implementation of a scalable Datalog system using Hadoop as the underlying runtime system. Observing that several successful projects provide a relational algebra-based programming interface to Hadoop, we argue that a natural extension is to add recursion to support scalable social network analysis, internet traffic analysis, ...

19
August 2012 MFCS'12: Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0

In Online Sum-Radii Clustering, n demand points arrive online and must be irrevocably assigned to a cluster upon arrival. The cost of each cluster is the sum of a fixed opening cost and its radius, and the objective is to minimize the total cost of the clusters opened by the ...

20 published by ACM
May 2012 PODS '12: Proceedings of the 31st ACM SIGMOD-SIGACT-SIGAI symposium on Principles of Database Systems
Publisher: ACM
Bibliometrics:
Citation Count: 21
Downloads (6 Weeks): 2,   Downloads (12 Months): 25,   Downloads (Overall): 406

Full text available: PDFPDF
Data is increasingly being bought and sold online, and Web-based marketplace services have emerged to facilitate these activities. However, current mechanisms for pricing data are very simple: buyers can choose only from a set of explicit views, each with a specific price. In this paper, we propose a framework for ...
Keywords: query determinacy, data pricing, arbitrage



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us