Search the World's Largest Database of Information Science & Technology Terms & Definitions
InfInfoScipedia LogoScipedia
A Free Service of IGI Global Publishing House
Below please find a list of definitions for the term that
you selected from multiple scholarly research resources.

What is Depth First Search

Handbook of Research on Innovative Database Query Processing Techniques
Its acronym is DFS. It is a search algorithm that traverses a graph by paths.
Published in Chapter:
Evaluating Top-k Skyline Queries on R-Trees
Marlene Goncalves (Universidad Simón Bolívar, Venezuela), Fabiana Reggio (Universidad Simón Bolívar, Venezuela), and Krisvely Varela (Universidad Simón Bolívar, Venezuela)
DOI: 10.4018/978-1-4666-8767-7.ch003
Abstract
The Skyline queries retrieve a set of data whose elements are incomparable in terms of multiple user-defined criteria. In addition, Top-k Skyline queries filter the best k Skyline points where k is the number of answers desired by the user. Several index-based algorithms have been proposed for the evaluation of Top-k Skyline queries. These algorithms make use of indexes defined on a single attribute and they require an index for each user-defined criterion. In traditional databases, the use of multidimensional indices has shown that may improve the performance of database queries. In this chapter, three pruning criteria were defined and several algorithms were developed to evaluate Top-k Skyline queries. The proposed algorithms are based on a multidimensional index, pruning criteria and the strategies Depth First Search and Breadth First Search. Finally, an experimental study was conducted in this chapter to analyze the performance and answer quality of the proposed algorithms.
Full Text Chapter Download: US $37.50 Add to Cart
eContent Pro Discount Banner
InfoSci OnDemandECP Editorial ServicesAGOSR