@InProceedings{	  valiveti_adaptive_1991,
  location	= {Berlin, Heidelberg},
  title		= {Adaptive linear list reorganization for a system
		  processing set queries},
  isbn		= {978-3-540-38391-8},
  abstract	= {The problem of reorganizing a linear list, when the
		  individual records are accessed independently, has been
		  well studied. In this paper, self-organizing linear list
		  heuristics are examined under a more general query system
		  which allows accesses to any subset of the list of
		  elements. We propose a pragmatic model for the query
		  generator, characterized by a set of parameters of size
		  equal to the number of elements in the list. We derive the
		  distribution of accesses to the individual records of the
		  list, and show that these accesses are statistically
		  dependent. Throughout this paper, the set accesses are
		  processed by serializing the set elements.},
  pages		= {405--414},
  booktitle	= {Fundamentals of Computation Theory},
  publisher	= {Springer Berlin Heidelberg},
  author	= {Valiveti, R. S. and Oommen, B. J. and Zgierski, J. R.},
  editor	= {Budach, L.},
  date		= {1991}
}

{"_id":"N5terxLBaHncLmvEh","bibbaseid":"valiveti-oommen-zgierski-adaptivelinearlistreorganizationforasystemprocessingsetqueries","author_short":["Valiveti, R. S.","Oommen, B. J.","Zgierski, J. R."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","location":"Berlin, Heidelberg","title":"Adaptive linear list reorganization for a system processing set queries","isbn":"978-3-540-38391-8","abstract":"The problem of reorganizing a linear list, when the individual records are accessed independently, has been well studied. In this paper, self-organizing linear list heuristics are examined under a more general query system which allows accesses to any subset of the list of elements. We propose a pragmatic model for the query generator, characterized by a set of parameters of size equal to the number of elements in the list. We derive the distribution of accesses to the individual records of the list, and show that these accesses are statistically dependent. Throughout this paper, the set accesses are processed by serializing the set elements.","pages":"405–414","booktitle":"Fundamentals of Computation Theory","publisher":"Springer Berlin Heidelberg","author":[{"propositions":[],"lastnames":["Valiveti"],"firstnames":["R.","S."],"suffixes":[]},{"propositions":[],"lastnames":["Oommen"],"firstnames":["B.","J."],"suffixes":[]},{"propositions":[],"lastnames":["Zgierski"],"firstnames":["J.","R."],"suffixes":[]}],"editor":[{"propositions":[],"lastnames":["Budach"],"firstnames":["L."],"suffixes":[]}],"date":"1991","bibtex":"@InProceedings{\t valiveti_adaptive_1991,\n location\t= {Berlin, Heidelberg},\n title\t\t= {Adaptive linear list reorganization for a system\n\t\t processing set queries},\n isbn\t\t= {978-3-540-38391-8},\n abstract\t= {The problem of reorganizing a linear list, when the\n\t\t individual records are accessed independently, has been\n\t\t well studied. In this paper, self-organizing linear list\n\t\t heuristics are examined under a more general query system\n\t\t which allows accesses to any subset of the list of\n\t\t elements. We propose a pragmatic model for the query\n\t\t generator, characterized by a set of parameters of size\n\t\t equal to the number of elements in the list. We derive the\n\t\t distribution of accesses to the individual records of the\n\t\t list, and show that these accesses are statistically\n\t\t dependent. Throughout this paper, the set accesses are\n\t\t processed by serializing the set elements.},\n pages\t\t= {405--414},\n booktitle\t= {Fundamentals of Computation Theory},\n publisher\t= {Springer Berlin Heidelberg},\n author\t= {Valiveti, R. S. and Oommen, B. J. and Zgierski, J. R.},\n editor\t= {Budach, L.},\n date\t\t= {1991}\n}\n\n","author_short":["Valiveti, R. S.","Oommen, B. J.","Zgierski, J. R."],"editor_short":["Budach, L."],"key":"valiveti_adaptive_1991","id":"valiveti_adaptive_1991","bibbaseid":"valiveti-oommen-zgierski-adaptivelinearlistreorganizationforasystemprocessingsetqueries","role":"author","urls":{},"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"https://raw.githubusercontent.com/rsvaliveti/pubs/main/papers.bib","dataSources":["Ya3KsBG9WEWneaMEw"],"keywords":[],"search_terms":["adaptive","linear","list","reorganization","system","processing","set","queries","valiveti","oommen","zgierski"],"title":"Adaptive linear list reorganization for a system processing set queries","year":null}