Sign In

Login

Password

Forgot Password ? Sign Up

Quotient filter (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Quotient filter" in English language version.

refsWebsite
Global rank English rank
4doi.org
2nd place
2nd place
4semanticscholar.org
11th place
8th place
1web.archive.org
1st place
1st place
1it-c.dk
low place
low place
1neu.edu
low place
7,273rd place
1usenix.org
5,990th place
3,752nd place
1vldb.org
low place
low place
1arxiv.org
69th place
59th place
1harvard.edu
18th place
17th place
1googleusercontent.com
243rd place
882nd place
1sunysb.edu
9,785th place
9,347th place

arxiv.org

doi.org

  • Cleary, John G. (September 1984). "Compact hash tables using bidirectional linear probing". IEEE Transactions on Computers. 33 (9): 828–834. doi:10.1109/TC.1984.1676499. S2CID 195908955.
  • Bender, Michael A.; Farach-Colton, Martin; Johnson, Rob; Kraner, Russell; Kuszmaul, Bradley C.; Medjedovic, Dzejla; Montes, Pablo; Shetty, Pradeep; Spillane, Richard P.; Zadok, Erez (27–31 August 2012). "Don't thrash: how to cache your hash on flash" (PDF). Proceedings of the VLDB Endowment. 5 (11): 1627–1637. arXiv:1208.0290. Bibcode:2012arXiv1208.0290B. doi:10.14778/2350229.2350275. S2CID 47180056.
  • Pandey, Prashant; Bender, Michael A.; Johnson, Rob; Patro, Rob (May 2017). "A General-Purpose Counting Filter: Making Every Bit Count". Proceedings of the 2017 ACM International Conference on Management of Data (SIGMOD '17). doi:10.1145/3035918.3035963.
  • O'Neil, Patrick; et al. (1996). "The log-structured merge-tree (LSM-tree)". Acta Informatica. 33 (4): 351–385. doi:10.1007/s002360050048. S2CID 12627452.

googleusercontent.com

static.googleusercontent.com

harvard.edu

ui.adsabs.harvard.edu

it-c.dk

neu.edu

ccs.neu.edu

  • Dillinger, Peter C.; Manolios, Panagiotis (2009). "Fast, All-Purpose State Storage". 16th International SPIN Workshop on Model Checking Software. Springer, Lecture Notes in Computer Science 5578.

semanticscholar.org

api.semanticscholar.org

  • Cleary, John G. (September 1984). "Compact hash tables using bidirectional linear probing". IEEE Transactions on Computers. 33 (9): 828–834. doi:10.1109/TC.1984.1676499. S2CID 195908955.
  • Bender, Michael A.; Farach-Colton, Martin; Johnson, Rob; Kraner, Russell; Kuszmaul, Bradley C.; Medjedovic, Dzejla; Montes, Pablo; Shetty, Pradeep; Spillane, Richard P.; Zadok, Erez (27–31 August 2012). "Don't thrash: how to cache your hash on flash" (PDF). Proceedings of the VLDB Endowment. 5 (11): 1627–1637. arXiv:1208.0290. Bibcode:2012arXiv1208.0290B. doi:10.14778/2350229.2350275. S2CID 47180056.
  • O'Neil, Patrick; et al. (1996). "The log-structured merge-tree (LSM-tree)". Acta Informatica. 33 (4): 351–385. doi:10.1007/s002360050048. S2CID 12627452.

semanticscholar.org

  • Cleary, John G. (September 1984). "Compact hash tables using bidirectional linear probing". IEEE Transactions on Computers. 33 (9): 828–834. doi:10.1109/TC.1984.1676499. S2CID 195908955.

sunysb.edu

fsl.cs.sunysb.edu

usenix.org

static.usenix.org

  • Bender, Michael A.; Farach-Colton, Martin; Johnson, Rob; Kuszmaul, Bradley C.; Medjedovic, Dzejla; Montes, Pablo; Shetty, Pradeep; Spillane, Richard P.; Zadok, Erez (June 2011). "Don't thrash: how to cache your hash on flash" (PDF). Proceedings of the 3rd USENIX conference on Hot topics in storage and file systems (HotStorage'11). Retrieved 21 July 2012.

vldb.org

web.archive.org