BibSLEIGH — Thomas

Travelled to:

1 × Australia
1 × Austria
1 × Germany
1 × Korea
1 × Mexico
1 × Singapore
1 × The Netherlands
3 × Canada
5 × USA

Collaborated with:

G.Weikum A.Kemper G.Moerkotte T.Mühlbauer F.Funke V.Leis A.Gubichev K.Berberich S.J.Bedathur C.Hornung T.Crecelius M.Kacimi S.Michel J.X.Parreira R.Schenkel J.Finis R.Brunel N.May F.Färber W.Rödiger R.Seilbeck A.Reiser M.Albutiu N.Preda G.Kasneci F.M.Suchanek G.Steidl M.Sozio S.Helmer K.Kundhikanjana N.Augsten A.Miraglia P.A.Boncz W.Yuan M.Ramanath M.Then M.Kaufmann F.Chirigati T.Hoang-Vu K.Pham H.T.Vo

Talks about:

databas (7) queri (6) rdf (6) effici (5) dynam (5) join (5) transact (3) knowledg (3) process (3) social (3)

Person: Thomas Neumann

DBLP: Neumann:Thomas

Contributed to:

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2004

2003

1982

Wrote 31 papers:

SIGMOD-2015-0001MK #concurrent #database #in memory #multi #performance: Fast Serializable Multi-Version Concurrency Control for Main-Memory Database Systems (TN, TM, AK), pp. 677–689.
VLDB-2015-FinisBK0MF: Indexing Highly Dynamic Hierarchical Data (JF, RB, AK, TN, NM, FF), pp. 986–997.
VLDB-2015-LeisKK0 #performance #query #sql: Efficient Processing of Window Functions in Analytical SQL Queries (VL, KK, AK, TN), pp. 1058–1069.
VLDB-2015-ThenKCHPK0V14 #graph #multi #performance #traversal: The More the Merrier: Efficient Multi-Source Graph Traversal (MT, MK, FC, TAHV, KP, AK, TN, HTV), pp. 449–460.
SIGMOD-2014-AugstenM0K #database #on the fly #relational #similarity: On-the-fly token similarity joins in relational databases (NA, AM, TN, AK), pp. 1495–1506.
SIGMOD-2014-LeisBK0 #evaluation #framework #manycore #parallel #query: Morsel-driven parallelism: a NUMA-aware query evaluation framework for the many-core age (VL, PAB, AK, TN), pp. 743–754.
SIGMOD-2014-MuhlbauerRSRK0: One DBMS for all: the brawny few and the wimpy crowd (TM, WR, RS, AR, AK, TN), pp. 697–700.
SIGMOD-2013-FinisBK0FM #named #performance #version control: DeltaNI: an efficient labeling scheme for versioned hierarchical data (JF, RB, AK, TN, FF, NM), pp. 905–916.
VLDB-2013-MuhlbauerRSRK0 #database #in memory #memory management: Instant Loading for Main Memory Databases (TM, WR, RS, AR, AK, TN), pp. 1702–1713.
CIKM-2012-GubichevN #approximate #graph #performance #scalability: Fast approximation of steiner trees in large graphs (AG, TN), pp. 1497–1501.
VLDB-2012-AlbutiuKN #database #in memory #manycore #memory management #parallel: Massively Parallel Sort-Merge Joins in Main Memory Multi-Core Database Systems (MCA, AK, TN), pp. 1064–1075.
VLDB-2012-FunkeKN #database #hybrid #transaction: Compacting Transactional Data in Hybrid OLTP & OLAP Databases (FF, AK, TN), pp. 1424–1435.
VLDB-2011-FunkeKN #query #transaction: HyPer-sonic Combined Transaction AND Query Processing (FF, AK, TN), pp. 1367–1370.
VLDB-2011-MoerkotteN #query: Accelerating Queries with Group-By and Join by Groupjoin (GM, TN), pp. 843–851.
SIGMOD-2010-PredaKSNYW #knowledge base #rdf #web #web service: Active knowledge: dynamically enriching RDF knowledge bases by web services (NP, GK, FMS, TN, WY, GW), pp. 399–410.
VLDB-2010-NeumannW #consistency #database #named #performance #query #rdf: x-RDF-3X: Fast Querying, High Update Rates, and Consistency for RDF Databases (TN, GW), pp. 256–263.
SIGMOD-2009-NeumannW #graph #rdf #scalability: Scalable join processing on very large RDF graphs (TN, GW), pp. 627–640.
VLDB-2009-MoerkotteNS #bound #estimation #fault: Preventing Bad Plans by Bounding the Impact of Cardinality Estimation Errors (GM, TN, GS), pp. 982–993.
VLDB-2009-PredaSKNRW #interactive #named: ANGIE: Active Knowledge for Interactive Exploration (NP, FMS, GK, TN, MR, GW), pp. 1570–1573.
PODS-2008-SozioNW #network #peer-to-peer #replication: Near-optimal dynamic replication in unstructured peer-to-peer networks (MS, TN, GW), pp. 281–290.
SIGIR-2008-CreceliusKMNPSW #recommendation #social: Social recommendations at work (TC, MK, SM, TN, JXP, RS, GW), p. 884.
SIGIR-2008-SchenkelCKMNPW #network #performance #query: Efficient top-k querying over social-tagging networks (RS, TC, MK, SM, TN, JXP, GW), pp. 523–530.
SIGMOD-2008-MoerkotteN #programming: Dynamic programming strikes back (GM, TN), pp. 539–552.
VLDB-2008-CreceliusKMNPSW: Making SENSE: socially enhanced search and exploration (TC, MK, SM, TN, JXP, RS, GW), pp. 1480–1483.
VLDB-2008-NeumannW #named #rdf: RDF-3X: a RISC-style engine for RDF (TN, GW), pp. 647–659.
SIGIR-2007-BerberichBNW: A time machine for text search (KB, SJB, TN, GW), pp. 519–526.
VLDB-2007-BerberichBNW #named #performance: FluxCapacitor: Efficient Time-Travel Text Search (KB, SJB, TN, GW), pp. 1414–1417.
VLDB-2006-MoerkotteN #algorithm #analysis #generative #programming: Analysis of Two Existing and One New Dynamic Programming Algorithm for the Generation of Optimal Bushy Join Trees without Cross Products (GM, TN), pp. 930–941.
VLDB-2004-NeumannM #framework #optimisation #order: A Combined Framework for Grouping and Order Optimization (TN, GM), pp. 960–971.
VLDB-2003-HelmerNM #clustering: Estimating the Output Cardinality of Partial Preaggregation with a Measure of Clusteredness (SH, TN, GM), pp. 656–667.
VLDB-1982-NeumannH #consistency #database #transaction: Consistency and Transactions in CAD Database (TN, CH), pp. 181–188.