GI LogoGI Logo
  • Login
Digital Library
    • All of DSpace

      • Communities & Collections
      • Titles
      • Authors
      • By Issue Date
      • Subjects
    • This Collection

      • Titles
      • Authors
      • By Issue Date
      • Subjects
Digital Library Gesellschaft für Informatik e.V.
GI-DL
    • English
    • Deutsch
  • English 
    • English
    • Deutsch
Search 
  •   DSpace Home
  • Lecture Notes in Informatics
  • Proceedings
  • BTW - Datenbanksysteme für Business, Technologie und Web
  • P289 - BTW2019 - Datenbanksysteme für Business, Technologie und Web
  • Search
JavaScript is disabled for your browser. Some features of this site may not work without it.
  •   DSpace Home
  • Lecture Notes in Informatics
  • Proceedings
  • BTW - Datenbanksysteme für Business, Technologie und Web
  • P289 - BTW2019 - Datenbanksysteme für Business, Technologie und Web
  • Search

Search

DiscoverDiscover

Filters

Use filters to refine the search results.

Now showing items 1-5 of 5

Results Per Page:Sort Options:

Explore FREDDY: Fast Word Embeddings in Database Systems 

BTW 2019 Günther, Michael; Thiele, Maik; Lehner, Wolfgang; Yanakiev, Zdravko
Word embeddings encode a lot of semantic as well as syntactic features and therefore are useful in many tasks especially in Natural Language Processing and Information Retrieval. FREDDY (Fast woRd EmbedDings Database sYstems), an extended PostgreSQL database system, allowing the user to analyze structured knowledge in ...

BTW2019 - Datenbanksysteme für Business, Technologie und WebBTW2019 - Datenbanksysteme für Business, Technologie und Web 

BTW 2019 Grust, Torsten; Naumann, Felix; Böhm, Alexander; Lehner, Wolfgang; Härder, Theo; Rahm, Erhard; Heuer, Andreas; Klettke, Meike; Meyer, Holger

Fighting the Duplicates in Hashing: Conflict Detection-aware Vectorization of Linear Probing 

BTW 2019 Pietrzyk, Johannes; Ungethüm, Annett; Habich, Dirk; Lehner, Wolfgang
Hash tables are a core data structure in database systems, because they are fundamental for many database operators like hash-based join and aggregation. In recent years, the efficient vectorized implementation using SIMD (Single Instruction Multiple Data) instructions has attracted a lot of attention. Generally, all ...

Fast Approximated Nearest Neighbor Joins For Relational Database Systems 

BTW 2019 Günther, Michael; Thiele, Maik; Lehner, Wolfgang
K nearest neighbor search (kNN-Search) is a universal data processing technique and a fundamental operation for word embeddings trained by word2vec or related approaches. The benefits of operations on dense vectors like word embeddings for analytical functionalities of RDBMSs motivate an integration of kNN-Joins. However, ...

NeMeSys – Energy Adaptive Graph Pattern Matching on NUMA-based Multiprocessor Systems 

BTW 2019 Krause, Alexander; Ungethüm, Annett; Kissinger, Thomas; Habich, Dirk; Lehner, Wolfgang
NeMeSys is a NUMA-aware graph pattern processing engine, which leverages intelligent resource management for energy adaptive processing. With modern server systems incorporating an increasing amount of main memory, we can store graphs and compute analytical graph algorithms like graph pattern matching completely in-memory. ...

About uns | FAQ | Help | Imprint | Datenschutz

Gesellschaft für Informatik e.V. (GI), Kontakt: Geschäftsstelle der GI
Diese Digital Library basiert auf DSpace.

 

 

Discover

Author

Lehner, Wolfgang (5)
Günther, Michael (2)Habich, Dirk (2)Thiele, Maik (2)Ungethüm, Annett (2)Böhm, Alexander (1)Grust, Torsten (1)Heuer, Andreas (1)Härder, Theo (1)Kissinger, Thomas (1)... View More

Subject

word embeddings (2)Adaptivity (1)approximated nearest neighbor search (1)Conflict Detection (1)Energy (1)Graph (1)Hashing (1)k nearest neighbor queries (1)Linear Probing (1)NUMA (1)... View More

Date Issued

2019 (5)

Has File(s)

Yes (5)

About uns | FAQ | Help | Imprint | Datenschutz

Gesellschaft für Informatik e.V. (GI), Kontakt: Geschäftsstelle der GI
Diese Digital Library basiert auf DSpace.