default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 20 matches
- 2023
- Jiongkang Ni, Xiaoliang Xu, Yuxiang Wang, Can Li, Jiajie Yao, Shihai Xiao, Xuecang Zhang:
DiskANN++: Efficient Page-based Search over Isomorphic Mapped Graph Index using Query-sensitivity Entry Vertex. CoRR abs/2310.00402 (2023) - 2022
- Lei Si, Shujie Pang, Yuhui Deng
, Weiheng Zhu, Yi Zhou, Yifeng Zhu:
DM-Pages: Improving Energy Efficiency of Disk Storage Systems and Cache Performance Using Deduplication-Based Mixed Pages. J. Circuits Syst. Comput. 31(16): 2250275:1-2250275:22 (2022) - 2017
- Maria Kallionpää, Chris Greenhalgh, Adrian Hazzard, David M. Weigl, Kevin R. Page, Steve Benford:
Composing and realising a game-like performance for disklavier and electronics. NIME 2017: 464-469 - Disk Page. Encyclopedia of GIS 2017: 483
- 2015
- Yan Niu, Wei Liu, Fei Xiang, Lihong Wang:
Fast Memory Deduplication of Disk Cache Pages in Virtual Environments. BDCloud 2015: 31-37 - 2012
- Wen-Huei Lin, Li-Pin Chang:
Dual Greedy: Adaptive garbage collection for page-mapping solid-state disks. DATE 2012: 117-122 - 2008
- Disk Page. Encyclopedia of GIS 2008: 245
- 2006
- Martin Karresand
, Nahid Shahmehri:
Oscar - File Type Identification of Binary Data in Disk Clusters and RAM Pages. SEC 2006: 413-424 - 2001
- Alexander Kröner:
Adaptive layout of dynamic web pages. Saarland University, Saarbrücken, Germany, DISKI 248, Infix Akademische Verlagsgesellschaft 2001, ISBN 978-3-89838-248-9, pp. I-XXII, 1-238 - 1993
- Elizabeth J. O'Neil, Patrick E. O'Neil, Gerhard Weikum:
The LRU-K Page Replacement Algorithm For Database Disk Buffering. SIGMOD Conference 1993: 297-306 - Bernhard Seeger, Per-Åke Larson, Ron McFadyen:
Reading a Set of Disk Pages. VLDB 1993: 592-603 - 1992
- J. H. Chou, Y. H. Chin:
A Study on the Database Management System's Performance from the Viewpoint of Buffer Page Replacement Algorithms and Disk Scheduling Algorithms. J. Inf. Sci. Eng. 8(2): 243-259 (1992) - Tony Owen:
Numerical Recipes Book (PASCAL) by William H. Press, Brian P. Flannery, Saul A. Teukolsky and William T. Vetterling Cambridge University Press, Cambridge, 1990, 759 pages including index (£30.00 hdb).Numerical Recipes Diskette (PASCAL) version 2.0 by William H. Press, et al. Cambridge University Press, Cambridge, 03 1990 (£21.50).Numerical Recipes Example Handbook (PASCAL) by William H. Press, Brian P. Flannery, Saul A. Teukolsky and William T. Vetterling Cambridge University Press, Cambridge, 09 1990, 223 pages including index of demonstrated procedures (£19·50, hdb).Numerical Recipes Example Diskette (PASCAL) version 2.0 by William H. Press et al. Cambridge University Press, Cambridge, 02 1990 (£21.50).Numerical Recipes Routines and Examples in Basic by Julian C. Sprott Cambridge University Press, Cambridge (paperback), 1991, 398 pages including index of programs (£19.50; pbk).Numerical Recipes Diskette Basic version 1.0 by Julian C. Sprott Cambridge University Press, Cambridge, 1991 (£21.50). Robotica 10(5): 469-470 (1992) - 1991
- C. Mohan, Inderpal Narang:
Recovery and Coherency-Control Protocols for Fast Intersystem Page Transfer and Fine-Granularity Locking in a Shared Disks Transaction Environment. VLDB 1991: 193-207 - 1990
- Jason Gait:
A Checkpointing Page Store for Write-Once Optical Disk. IEEE Trans. Computers 39(1): 2-9 (1990) - 1989
- Ken Johnson:
Prolog for programmers by Feliks Kluzniak and Stanislaw Szpakowicz, with a contribution by Janusz S. Bien, Academic Press, 1985, reprinted 1987, Paperback edition, ISBN 0-12-416521-4, 308 pages including many diagrams and listings. Includes Toy-Prolog for IBM-PC on 5¼ inch floppy disk. $14.95. Knowl. Eng. Rev. 4(1): 73-74 (1989) - 1988
- C.-C. Wang, Bob P. Weems:
Some Considerations in Using VSCAN Disk Scheduling With Optimal Page Arrangements. SIGMETRICS 1988: 273 - 1984
- Yuzuru Tanaka:
A Multiport Page-Memory Architecture and A Multiport Disk-Cache System. New Gener. Comput. 2(3): 242-260 (1984) - 1983
- Matthew S. Hecht, John D. Gabbe:
Shadowed Management of Free Disk Pages with a Linked List. ACM Trans. Database Syst. 8(4): 503-514 (1983) - William R. Nugent, Jessica R. Harding:
Beyond videotex: The library of congress pilot project in page image retrieval and transmission digital optical disk. SIGCOMM 1983: 39
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2025-06-02 03:21 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint