Остановите войну!
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 40 matches
- 2001
- Solomon Atnafu, Lionel Brunie, Harald Kosch:
Similarity-Based Operators and Query Optimization for Multimedia Database Systems. IDEAS 2001: 346-355 - Jorge Bernardino, Henrique Madeira:
Experimental Evaluation of a New Distributed Partitioning Technique for Data Warehouses. IDEAS 2001: 312-321 - Jean-François Boulicaut, Baptiste Jeudy:
Mining Free Itemsets under Constraints. IDEAS 2001: 322-329 - Donald D. Chamberlin:
Query Languages and XML. IDEAS 2001: 297-300 - Panagiotis Chountas, Ilias Petrounias:
Virtual Integration of Temporal and Conflicting Information. IDEAS 2001: 243-248 - Amitabha Das, Koh Yen Kai:
Tradeoff between Client and Server Transaction Validation in Mobile Environment. IDEAS 2001: 265-272 - Keir B. Davis, Fereidoon Sadri:
Optimization of SchemaSQL Queries. IDEAS 2001: 111-116 - Kemal A. Delic, Laurent Douillet, Umeshwar Dayal:
Towards an Architecture for Real-Time Decision Support Systems: Challenges and Solutions. IDEAS 2001: 303-311 - Baher A. El-Geresy, Alia I. Abdelmoty:
Qualitative Representations in Large Spatial Databases. IDEAS 2001: 68-75 - Lixin Fu, Sanguthevar Rajasekaran:
Novel Algorithms for Computing Medians and Other Quantiles of Disk-Resident Data. IDEAS 2001: 145-154 - Jeevani Samantha Goonetillake, Tom W. Carnduff, W. A. Gray:
Integrity Constraint Management for Design Object Versions in a Concurrent Engineering Design Environment. IDEAS 2001: 255-261 - Amit Gupta, S. Sudarshan, S. Viswanathan:
Query Scheduling in Multi Query Optimization. IDEAS 2001: 11-19 - He Jingmin, Min Wang:
Cryptography and Relational Database Management Systems. IDEAS 2001: 273-284 - Konstantinos Kalpakis, Koustuv Dasgupta, Ouri Wolfson:
Steiner-Optimal Data Replication in Tree Networks with Storage Costs. IDEAS 2001: 285-293 - Mingchun Liu, Chunru Wan:
A Study on Content-Based Classification and Retrieval of Audio Database. IDEAS 2001: 339-345 - Stéphane Lopes, Jean-Marc Petit, Lotfi Lakhal:
A Framework for Understanding Existing Databases. IDEAS 2001: 330-338 - Sergio Luján-Mora, Manuel Palomar:
Reducing Inconsistency in Integrating Data From Different Sources. IDEAS 2001: 209-218 - Wolfgang May:
XPathLog: A Declarative, Native XML Data Manipulation Language. IDEAS 2001: 123-128 - Mirella Moura Moro, Silvia Maria Saggiorato, Nina Edelweiss, Clesio Saraiva dos Santos:
Dynamic Systems Specification Using Versions and Time. IDEAS 2001: 99-107 - Ratko Orlandic, Byunggu Yu:
Implementing KDB-Trees to Support High-Dimensional Data. IDEAS 2001: 58-67 - Jacek Plodzien, Kazimierz Subieta:
Static Analysis of Queries as a Tool for Static Optimization. IDEAS 2001: 117-122 - Frank Ramsak, Volker Markl, Robert Fenk, Rudolf Bayer, Thomas Ruf:
Interactive ROLAP on Large Datasets: A Case Study with UB-Trees. IDEAS 2001: 167-176 - Chantal Reynaud, Jean-Pierre Sirot, Dan Vodislav:
Semantic Integration of XML Heterogeneous Data Sources. IDEAS 2001: 199-208 - Kai-Uwe Sattler, Eike Schallehn:
A Data Preparation Framework based on a Multidatabase Language. IDEAS 2001: 219-228 - Hans-Jörg Schek:
Evolution of Database Technology: Hyperdatabases. IDEAS 2001: 139-141 - Martin Schönhoff, Markus Strässler, Klaus R. Dittrich:
Version Propagation in Federated Database Systems. IDEAS 2001: 189-198 - Holger Schwarz, Ralf Wagner, Bernhard Mitschang:
Improving the Processing of Decision Support Queries: The Case for a DSS Optimizer. IDEAS 2001: 177-186 - Leonard D. Shapiro, David Maier, Paul Benninghoff, Keith Billings, Yubo Fan, Kavita Hatwal, Quan Wang, Yu Zhang, Hsiao-min Wu, Bennet Vance:
Exploiting Upper and Lower Bounds In Top-Down Query Optimization. IDEAS 2001: 20-33 - Xiaohui Shen, Wei-keng Liao, Alok N. Choudhary:
An Integrated Graphical User Interface for High Performance Distributed Computing. IDEAS 2001: 237-242 - Renato O. Stehling, Mario A. Nascimento, Alexandre X. Falcão:
An Adaptive and Efficient Clustering-Based Approach for Content-Based Image Retrieval in Image Databases. IDEAS 2001: 356-365
skipping 10 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-05-23 06:03 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