Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Doubly-chained tree data base organisation--analysis and design strategies

From MaRDI portal
Publication:4120122
Jump to:navigation, search

DOI10.1093/COMJNL/20.1.15zbMATH Open0349.68014OpenAlexW2129404824MaRDI QIDQ4120122FDOQ4120122


Authors: Alfonso F. Cardenas, James P. Sagamang Edit this on Wikidata


Publication date: 1977

Published in: The Computer Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/comjnl/20.1.15





Mathematics Subject Classification ID

General topics in the theory of software (68N01) Information storage and retrieval of data (68P20) Algorithms in computer science (68W99)



Cited In (3)

  • Multidimensional B-trees: Analysis of dynamic behavior
  • Effects of updates on optimality in tries
  • Approximating block accesses in database organizations





This page was built for publication: Doubly-chained tree data base organisation--analysis and design strategies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4120122)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4120122&oldid=17900510"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 6 February 2024, at 08:15. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki