Scalable Indexing
Scalable Indexing is a content-addressable storage mechanism that enables efficient and dynamically extensible retrieval of data objects by distributing index entries across a growing number of nodes while maintaining sub-linear lookup complexity.
788
Publications
50.8K
Citations
2.1K
Authors
554
Institutions
Publications per year
2017–2026
146
Parents
788
Progressive skyline computation in database systems
Dimitris Papadias, Yufei Tao, Greg Fu et al. · ACM Transactions on Database Systems · 2005 · 886 citations
Proceedings of the 27th International Conference on Very Large Data Bases
Peter M. G. Apers, Paolo Atzeni, Stefano Ceri et al. · 2001 · 845 citations
Efficient Progressive Skyline Computation
Kian‐Lee Tan, Pin-Kwang Eng, Beng Chin Ooi · Very Large Data Bases · 2001 · 703 citations
1–5 of 788
2.1K
17
h-index
13
h-index
11
h-index
9
h-index
9
h-index
1–5 of 2.1K
554
National University of Singapore
Singapore, Singapore
21 h-index
62 publications
4.8K citations
Université Paris Cité
Paris, France
16 h-index
21 publications
753 citations
Microsoft (United States)
Redmond, United States
15 h-index
33 publications
1.3K citations
University of Maryland, College Park
College Park, United States
14 h-index
34 publications
2.9K citations
Chinese University of Hong Kong
Hong Kong, Hong Kong
14 h-index
36 publications
1.8K citations
Stanford University
Stanford, United States
13 h-index
28 publications
5.1K citations
Carnegie Mellon University
Pittsburgh, United States
13 h-index
28 publications
2.2K citations
Tsinghua University
Beijing, China
13 h-index
41 publications
1.6K citations
1–8 of 554
PVLDB · 60 publications · 4K citations
32
h-index
TKDE · 31 publications · 1.5K citations
23
h-index
TODS · 13 publications · 2.7K citations
13
h-index
Repository · 15 publications · 275 citations
12
h-index
9 publications · 208 citations
9
h-index
1–5