ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • Data base  (1)
  • balances of binary trees  (1)
  • Springer  (2)
  • 1
    Electronic Resource
    Electronic Resource
    Bounds for optimalα-β binary trees (1977)
    Springer
    BIT 17 (1977), S. 1-15 
    Details
    ISSN: 1572-9125
    Keywords: Optimal α-β binary trees ; balances of binary trees ; total weighted path lengths ; variable-length codes ; data set allocation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In this paper we consider a special kind of binary trees where each right edge is associated with a positive numberα and each left edge with a positive numberβ(α ≦ β). Givenα, β and the number of nodesn, an optimal tree is one which minimizes the total weighted path length. An algorithm for constructing an optimal tree for givenα, β, n is presented, based on which bounds for balances and total weighted path lengths of optimal trees are derived.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01932395
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Storage cost considerations in secondary index selection (1975)
    Springer
    International journal of parallel programming 4 (1975), S. 307-327 
    Details
    ISSN: 1573-7640
    Keywords: Data base ; retrieval ; secondary indices ; index selection ; query time analysis ; knapsack problem ; storage cost ; storage blocks ; constrained minimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract This paper is concerned with the combined problem of selecting secondary indices for a large relational data base and placing data files and index files in multileveled storage. It is shown that if storage cost consideration is explicitly incorporated, then the optimization becomes nontrivial. An algorithm is presented for minimizing the expected query time under arbitrary storage cost constraints. The formulation includes the consideration that a physical storage block (rather than a single tuple) is the smallest unit of data transfer and that block size is level dependent.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00979372
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...