Rares Vernica

[ra'-resh]
PhD
Rares Vernica photo

Contact



Overview

PhD received in Summer 2011

Disertation: Efficient Processing of Set-Similarity Joins on Large Clusters
Advisers: Prof. Michael J. Carey and Prof. Chen Li

My research area is large-scale data management and data-intensive computing. Since September 2011 I am a Research Scientist at HP Labs in Palo Alto, CA.

Curriculum Vitae (CV)

Projects

ASTERIX
Developing a highly scalable parallel platform for semi-structured data management and analysis;
  • Source code for Parallel Set-Similarity Joins Using MapReduce;
Family Reunification
Developing data integration, indexing, and search techniques to help people find their loved ones during or after a disaster;
Flamingo
Developing data cleaning techniques to deal with errors and inconsistencies in information systems;

Publications

  1. Adaptive MapReduce using Situation-Aware Mappers.
    Rares Vernica, Andrey Balmin, Kevin S. Beyer, Vuk Ercegovac.
    EDBT 2012
  2. Efficient Processing of Set-Similarity Joins on Large Clusters.
    Rares Vernica.
    Ph.D. Thesis, University of California, Irvine, 2011.
    Advisers: Prof. Michael J. Carey and Prof. Chen Li
  3. CIRCUMFLEX: A Scheduling Optimizer for MapReduce Workloads Involving Shared Scans.
    Joel Wolf, Deepak Rajan, Kirsten Hildrum, Rohit Khandekar, Sujay Parekh, Kun-Lung Wu, Andrey Balmin, Rares Vernica.
    LADIS 2011. (Workshop on Large Scale Distributed Systems and Middleware, collocated with VLDB 2011)
  4. ASTERIX: Towards a Scalable, Semistructured Data Platform for Evolving World Models.
    Alexander Behm, Vinayak R. Borkar, Michael J. Carey, Chen Li, Nicola Onose, Rares Vernica, Alin Deutsch, Yannis Papakonstantinou, Vassilis J. Tsotras
    Journal of Distributed and Parallel Databases, Special Issue on Cloud Computing, 2011
  5. Hyracks: A Flexible and Extensible Foundation for Data-Intensive Computing
    Vinayak R. Borkar, Michael J. Carey, Raman Grover, Nicola Onose, Rares Vernica
    ICDE 2011
  6. AKYRA: Efficient Keyword-Query Cleaning in Relational Databases.
    Rares Vernica, Chen Li
    Technical Report, University of California, Irvine, 2011
  7. Efficient Parallel Set-Similarity Joins Using MapReduce.
    Rares Vernica, Michael J. Carey, Chen Li
    SIGMOD 2010
  8. Efficient Top-k Algorithms for Fuzzy Search in String Collections.
    Rares Vernica, Chen Li
    KEYS 2009: 9-14. (Workshop on Keyword Search on Structured Data, collocated with SIGMOD 2009)
    paper   doi   slides
  9. Entity Categorization Over Large Document Collections.
    Venkatesh Ganti, Arnd Christian K├Ânig, Rares Vernica
    KDD 2008: 274-282.
    paper   doi   slides
  10. SEPIA: Estimating Selectivities of Approximate String Predicates in Large Databases.
    Liang Jin, Chen Li, Rares Vernica
    VLDB J. 17(5): 1213-1229 (2008).
    paper   doi   slides   source code
  11. Relaxing Join and Selection Queries.
    Nick Koudas, Chen Li, Anthony K. H. Tung, Rares Vernica
    VLDB 2006: 199-210.

Awards

2010
Yahoo! Key Scientific Challenges Winner in the Web Information Management area - UCI article
2009
Microsoft Student Travel Award for KEYS 2009, Workshop on Keyword Search on Structured Data, collocated with SIGMOD 2009
2005-2006
Chair's Fellowship, Department of Computer Science, University of California, Irvine
2005
California Institute for Telecommunications and Information Technology (Calit2) Fellowship
2005
Second place, Pentalog programming contest, Brasov, Romania
1999 - 2004
Merit-Based Scholarship, Politehnica University of Bucharest, Romania

Hobby

Kendo
  • Member All United States Kendo Federation (AUSKF), Southern California Kendo Federation (SCKF), Costa Mesa Kendo Dojo;
  • Rank 2 Dan;
Rares Vernica - kendo