Остановите войну!
for scientists:
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 61 matches
- 1990
- Divyakant Agrawal, Amr El Abbadi:
The Tree Quorum Protocol: An Efficient Approach for Managing Replicated Data. VLDB 1990: 243-254 - Rakesh Agrawal, H. V. Jagadish:
Hybrid Transitive Closure Algorithms. VLDB 1990: 326-334 - Masaaki Aoshima, Yoshio Izumida, Akifumi Makinouchi, Fumio Suzuki, Yasuo Yamane:
The C-based Database Programming Language Jasmine/C. VLDB 1990: 539-551 - Bharat K. Bhargava, Shirley Browne:
Adaptable Recovery Using Dynamic Quorum Assignments. VLDB 1990: 231-242 - Michael J. Carey, Eugene J. Shekita, George Lapis, Bruce G. Lindsay, John McPherson:
An Incremental Join Attachment for Starburst. VLDB 1990: 662-673 - Tiziana Catarci, Giovanna D'Angiolini, Maurizio Lenzerini:
Concept Description Language for Statistical Data Modeling. VLDB 1990: 722-729 - Wojciech Cellary, Geneviève Jomier:
Consistency of Versions in Object-Oriented Databases. VLDB 1990: 432-441 - Stefano Ceri, Jennifer Widom:
Deriving Production Rules for Constraint Maintainance. VLDB 1990: 566-577 - Jean-Pierre Cheiney, Christophe de Maindreville:
A Parallel Strategy for Transitive Closure usind Double Hash-Based Clustering. VLDB 1990: 347-358 - Chris Clifton, Hector Garcia-Molina:
Indexing in a Hypertext Database. VLDB 1990: 36-49 - Asit Dan, Daniel M. Dias, Philip S. Yu:
The Effect of Skewed Data Access on Buffer Hits and Data Contention an a Data Sharing Environment. VLDB 1990: 419-431 - David J. DeWitt, Philippe Futtersack, David Maier, Fernando Vélez:
A Study of Three Alternative Workstation-Server Architectures for Object Oriented Database Systems. VLDB 1990: 107-121 - Pamela Drew, Roger King, Scott E. Hudson:
The Performance and Utility of the Cactis Implementation Algorithms. VLDB 1990: 135-147 - Ahmed K. Elmagarmid, Yungho Leu, Witold Litwin, Marek Rusinkiewicz:
A Multidatabase Transaction Model for InterBase. VLDB 1990: 507-518 - Ramez Elmasri, Gene T. J. Wuu, Yeong-Joon Kim:
The Time Index: An Access Structure for Temporal Data. VLDB 1990: 1-12 - Christian Esculier:
Non-Monotonic Knowledge Evolution in VLKDBs. VLDB 1990: 638-649 - Norbert Fuhr:
A Probabilistic Framework for Vague Queries and Imprecise Information in Databases. VLDB 1990: 696-707 - Hector Garcia-Molina, Christos A. Polyzois, Robert B. Hagmann:
Two Epoch Algorithms for Disaster Recovery. VLDB 1990: 222-230 - Shahram Ghandeharizadeh, David J. DeWitt:
Hybrid-Range Partitioning Strategy: A New Declustering Strategy for Multiprocessor Database Machines. VLDB 1990: 481-492 - Jim Gray, Bob Horst, Mark Walker:
Parity Striping of Disk Arrays: Low-Cost Reliable Storage with Acceptable Throughput. VLDB 1990: 148-161 - Lilian Harada, Miyuki Nakano, Masaru Kitsuregawa, Mikio Takagi:
Query Processing for Multi-Attribute Clustered Records. VLDB 1990: 59-70 - Thomas Hardjono, Jennifer Seberry:
Search Key Substitution in the Encipherment of B-Trees. VLDB 1990: 50-58 - Maurice A. W. Houtsma, Peter M. G. Apers, Stefano Ceri:
Distributed Transitive Closure Computations: The Disconnection Set Approach. VLDB 1990: 335-346 - Kien A. Hua, Chiang Lee:
An Adaptive Data Placement Scheme for Parallel Database Computer Systems. VLDB 1990: 493-506 - Guy Hulin:
On Restructuring Nested Relations in Partitioned Normal Form. VLDB 1990: 626-637 - Richard Hull, Masatoshi Yoshikawa:
ILOG: Declarative Creation and Manipulation of Object Identifiers. VLDB 1990: 455-468 - H. V. Jagadish:
On Indexing Line Segments. VLDB 1990: 614-625 - Rajiv Jauhari, Michael J. Carey, Miron Livny:
Priority-Hints: An Algorithm for Priority-Based Buffer Management. VLDB 1990: 708-721 - Manfred A. Jeusfeld, Michael Mertikas, Ingrid Wetzel, Matthias Jarke, Joachim W. Schmidt:
Database Application Development as an Object Modeling Activity. VLDB 1990: 442-454 - Wolfgang Käfer, Norbert Ritter, Harald Schöning:
Support for Temporal Data by Complex Objects. VLDB 1990: 24-35
skipping 31 more matches
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 2024-04-26 13:58 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