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

scientific article

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

zbMATH Open0727.68029MaRDI QIDQ3349970

S. B. Meleshchuk

Publication date: 1988



Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.


zbMATH Keywords

hierarchical record structurepaged memoryphysical data structures


Mathematics Subject Classification ID

Database theory (68P15)



Related Items (1)

Data page layouts for relational databases on deep memory hierarchies


Recommendations

  • Unnamed Item πŸ‘ πŸ‘Ž
  • Unnamed Item πŸ‘ πŸ‘Ž
  • The optimal structure of algorithms for \(\alpha\)-paging πŸ‘ πŸ‘Ž
  • On the relative dominance of paging algorithms πŸ‘ πŸ‘Ž
  • Upper bounds for multi-level multi-server paging πŸ‘ πŸ‘Ž
  • Algorithms for optimization of retrieval in a distributed memory system πŸ‘ πŸ‘Ž
  • Memory Paging for Connectivity and Path Problems in Graphs πŸ‘ πŸ‘Ž
  • An n log n Algorithm to Distribute n Records Optimally in a Sequential Access File πŸ‘ πŸ‘Ž
  • On the Relative Dominance of Paging Algorithms πŸ‘ πŸ‘Ž
  • A Primal-Dual Randomized Algorithm for Weighted Paging πŸ‘ πŸ‘Ž





This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3349970&oldid=16607625"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 4 February 2024, at 15:49.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki