Остановите войну!
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 27 matches
- 2013
- Foto N. Afrati, Jeffrey D. Ullman:
Matching bounds for the all-pairs MapReduce problem. IDEAS 2013: 3-4 - Michal Batko, Jan Botorek, Petra Budíková, Pavel Zezula:
Content-based annotation and classification framework: a general multi-purpose approach. IDEAS 2013: 58-67 - Ladjel Bellatreche, Salmi Cheikh, Sebastian Breß, Amira Kerkad, Ahcène Boukorca, Jalil Boukhobza:
How to exploit the device diversity and database interaction to propose a generic cost model? IDEAS 2013: 142-147 - Peter A. Boncz:
LDBC: benchmarks for graph and RDF data management. IDEAS 2013: 1-2 - Amir Dayyan Borhanian, Fereidoon Sadri:
A compact representation for efficient uncertain-information integration. IDEAS 2013: 122-131 - Stéphane Campinas, Renaud Delbru, Giovanni Tummarello:
Efficiency and precision trade-offs in graph summary algorithms. IDEAS 2013: 38-47 - Peter Chovanec, Michal Krátký:
On the efficiency of multiple range query processing in multidimensional data structures. IDEAS 2013: 14-27 - Alfredo Cuzzocrea, Francesco Folino, Clara Pizzuti:
DynamicNet: an effective and efficient algorithm for supporting community evolution detection in time-evolving information networks. IDEAS 2013: 148-153 - Alfredo Cuzzocrea, Domenico Saccà, Jeffrey D. Ullman:
Big data: a research agenda. IDEAS 2013: 198-203 - Fredton Doan, David Chiu, Brasil Perez Lukes, Jason Sawin, Gheorghi Guzun, Guadalupe Canahuate:
Dynamic bitmap index recompression through workload-based optimizations. IDEAS 2013: 96-105 - Nickerson Ferreira, Pedro Martins, Pedro Furtado:
Near real-time with traditional data warehouse architectures: factors and how-to. IDEAS 2013: 68-75 - Robert Gottstein, Ilia Petrov, Alejandro P. Buchmann:
Read optimisations for append storage on flash. IDEAS 2013: 106-113 - Goetz Graefe, Ilia Petrov, Todor Ivanov, Veselin Marinov:
A hybrid page layout integrating PAX and NSM. IDEAS 2013: 86-95 - Kun-Han Juang, En Tzu Wang, Chieh-Feng Chiang, Arbee L. P. Chen:
Verification of k-coverage on query line segments. IDEAS 2013: 114-121 - Dominik Köppl:
Breaking skyline computation down to the metal: the skyline breaker algorithm. IDEAS 2013: 132-141 - Liangzhe Li, Le Gruenwald:
Self-managing online partitioner for databases (SMOPD): a vertical database partitioning system with a fully automatic online approach. IDEAS 2013: 168-173 - Yann Loyer, Isma Sadoun, Karine Zeitouni:
Personalized progressive filtering of skyline queries in high dimensional spaces. IDEAS 2013: 186-191 - Houari Mahfoud, Abdessamad Imine, Michaël Rusinowitch:
SVMAX: a system for secure and valid manipulation of XML data. IDEAS 2013: 154-161 - Pedro Martins, Maryam Abbasi, Pedro Furtado:
Cloudy: heterogeneous middleware for in time queries processing. IDEAS 2013: 5-13 - Elio Masciari, Shi Gao, Carlo Zaniolo:
Sequential pattern mining from trajectory data. IDEAS 2013: 162-167 - Muntazir Mehdi, Ratnesh Sahay, Wassim Derguech, Edward Curry:
On-the-fly generation of multidimensional data cubes for web of things. IDEAS 2013: 28-37 - Michael Nolen, King-Ip (David) Lin:
Approximate high-dimensional nearest neighbor queries using R-forests. IDEAS 2013: 48-57 - Manish Patil, Rahul Shah, Sharma V. Thankachan:
Top-k join queries: overcoming the curse of anti-correlation. IDEAS 2013: 76-85 - Edemberg Rocha da Silva, Guilherme Barros de Souza, Ana Carolina Salgado:
Load balance for semantic cluster-based data integration systems. IDEAS 2013: 174-179 - Jose Subero, Marlene Goncalves:
Evaluating skyline queries over vertically partitioned tables. IDEAS 2013: 180-185 - Marco Taddeo, Alberto Trombetta, Danilo Montesi, Stefano Pierantozzi:
Querying data across different legal domains. IDEAS 2013: 192-197 - Bipin C. Desai, Josep Lluís Larriba-Pey, Jorge Bernardino:
17th International Database Engineering & Applications Symposium, IDEAS '13, Barcelona, Spain - October 09 - 11, 2013. ACM 2013, ISBN 978-1-4503-2025-2 [contents]
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-06-18 07:54 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