z-logo
open-access-imgOpen Access
Pendekatan MapReduce untuk Implementasi Suffix Tree pada AutoComplete Produk dengan Metodologi Agile
Author(s) -
Yosef Ariyanto Irawan,
Billyanto Hendrik,
Antonius Antonius,
Taufan Abdurrachman,
Arie Tunggal,
Bernard Renaldy Suteja
Publication year - 2019
Publication title -
jurnal teknik informatika dan sistem informasi
Language(s) - English
Resource type - Journals
ISSN - 2443-2229
DOI - 10.28932/jutisi.v5i2.1743
Subject(s) - computer science , agile software development , product (mathematics) , tree (set theory) , world wide web , mathematics , software engineering , combinatorics , geometry
The development of technology and communication today encourages everyone to get everything quickly, easily and precisely, especially in the world of e-commerce which is increasingly widespread and needed by almost everyone. The hope is that with just one keyword, customers can find the right product using a search engine. Therefore, in this study, the Agile Scrum, MapReduce, and Suffix Tree methods are used to create an application that can help users to find products quickly and provide suggestions based on keywords. With a target result of an average search time of less than 100 ms, the prototype of the application already has a fast and accurate response time to display suggestions for customers.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom