View Document Preview and Link Document Date: 2013-08-01 05:50:27 Open Document File Size: 886,20 KB Share Result on Facebook
City Trento / / Company 3SAT / G. / Vertex / / Country Italy / / Currency USD / / / Facility Beihang University wenfei@inf.ed.ac.uk University of Antwerp Hasselt University / University of Edinburgh / / IndustryTerm distributed query processing / incremental algorithm / breadth-depth search starts / search proceeds / cryptographic applications / online query evaluation / binary search / incremental algorithms / sublinear-time algorithms / bounded incremental algorithm / Parallel and distributed processing / search problem / breadth-depth search / bounded incremental algorithms / computing / parallel systems / online evaluation / query processing step / feasible solutions / search problems / / OperatingSystem L3 / / Organization VLDB Endowment / University of Antwerp / SKLSDE Lab / RCBD / University of Edinburgh / University of Limburg / Beihang University wenfei@inf.ed.ac.uk University / Antwerp Hasselt University / NC Q2 / NC NC / / Person Riva del Garda / Floris Geerts Frank Neven Informatics / / Position MP / / Product HTC HD2 Smartphone / / ProvinceOrState New Foundland and Labrador / North Carolina / / Technology PTIME algorithms / Pseudo sublinear-time algorithms / bounded incremental algorithm / NC algorithms / bounded incremental algorithms / random access / sublinear-time algorithms / / SocialTag 
Making Queries Tractable on Big Data with Preprocessing (through the eyes of complexity theory) Wenfei Fan Floris Geerts