2015
DOI: 10.1007/s10115-015-0830-y
|View full text |Cite
|
Sign up to set email alerts
|

A survey on indexing techniques for big data: taxonomy and performance evaluation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
108
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
9
1

Relationship

2
8

Authors

Journals

citations
Cited by 210 publications
(108 citation statements)
references
References 83 publications
0
108
0
Order By: Relevance
“…Big data is characterised by a huge volume and variety of data types; created at continually increasing rates [38]. Big data analytics allows for the extraction of meaningful information from large amounts of data produced by ICTs [37][38][39].…”
Section: Research Frameworkmentioning
confidence: 99%
“…Big data is characterised by a huge volume and variety of data types; created at continually increasing rates [38]. Big data analytics allows for the extraction of meaningful information from large amounts of data produced by ICTs [37][38][39].…”
Section: Research Frameworkmentioning
confidence: 99%
“…Non-clustered indexing has been an efficient query execution and data retrieval mechanism for medical images [22], event stream data [23] and for face databases [24]. In our previous work [25], we have elaborated that non-clustered indexes are fast in creation, robust, small in size and their computational cost is less. However, B-Tree is more feasible as these indexes are adaptable to growing size and suitable for various types of data.…”
Section: Related Workmentioning
confidence: 99%
“…Indexing is a significant activity even for distributed highly available big data sets to efficiently perform data retrieval operations [8]. It is impractical to apply full scan on millions of records to accomplish search of a specific result [9].…”
Section: Introductionmentioning
confidence: 99%