• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 3
  • 1
  • Tagged with
  • 4
  • 4
  • 4
  • 2
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Elasticity of Elasticsearch

Tsaousi, Kleivi Dimitris January 2021 (has links)
Elasticsearch has evolved from an experimental, open-source, NoSQL database for full-text documents to an easily scalable search engine that canhandle a large amount of documents. This evolution has enabled companies todeploy Elasticsearch as an internal search engine for information retrieval (logs,documents, etc.). Later on, it was transformed as a cloud service and the latestdevelopment allows a containerized, serverless deployment of the application,using Docker and Kubernetes.This research examines the behaviour of the system by comparing the length and appearance of single-term and multiple-terms queries, the scaling behaviour and the security of the service. The application is deployed on Google Cloud Platform as a Kubernetes cluster hosting containerized Elasticsearch images that work as databasenodes of a bigger database cluster. As input data, a collection of JSON formatted documents containing the title and abstract of published papersin the field of computer science was used inside a single index. All the plots were extracted using Kibana visualization software. The results showed that multiple-term queries put a bigger stress on thesystem than single-term queries. Also the number of simultaneous users querying in the system is a big factor affecting the behaviour of the system. By scaling up the number of Elasticsearch nodes inside the cluster, indicated that more simultaneous requests could be served by the system.
2

Matematický vyhledávač / Mathematical Search Engine

Mišutka, Jozef January 2013 (has links)
Mathematics has been used to describe phenomena and problems in many re- search fields for centuries. The basic elements used in the description are formu- lae which express information symbolically. However, searching for mathematical knowledge in digital form using available tools is still cumbersome. We address this issue by presenting the mathematical search engine EgoMath, based on a full text searching, which can search for mathematical formulae and text. We perform an eval- uation over a large collection of documents showing that our solution is usable. Our approach can be used with huge document collections by applying one specialised technique. In order to provide a valuable evaluation of the quality, we built an al- ternative mathematical search engine using the feature extraction technique proposed by Ma et al. We propose important improvements to this solution achieving interest- ing results. We perform the first ever cross-evaluation of mathematical search engines based on different algorithms. A comprehensive survey of existing techniques avail- able, presented in this thesis, completes the picture of mathematical searching.
3

Webová aplikace pro fulltextové vyhledávání nad PDF dokumenty / Web Application for Fulltext Search in PDF Documents

Svoboda, Ondřej January 2012 (has links)
This master's thesis describes principles of full text search engines, design and implementation of web application for referencing and full text searching in PDF documents. It also contains an overview and comparison with currently available reference management software. There are discussed bibliographic information export possibilities in various citation styles and formats. Final application is written in PHP scripting language and uses MySQL database.
4

Use Case Driven Evaluation of Database Systems for ILDA

Thapa, Shova 18 November 2022 (has links)
No description available.

Page generated in 0.0426 seconds