Остановите войну!
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 26 matches
- 2007
- Klemens Böhm, Erik Buchmann:
Free riding-aware forwarding in Content-Addressable Networks. VLDB J. 16(4): 463-482 (2007) - Douglas Burdick, Prasad M. Deshpande, T. S. Jayram, Raghu Ramakrishnan, Shivakumar Vaithyanathan:
OLAP over uncertain and imprecise data. VLDB J. 16(1): 123-144 (2007) - Edward P. F. Chan, Heechul Lim:
Optimization and evaluation of shortest path queries. VLDB J. 16(3): 343-369 (2007) - Bi-Ru Dai, Cheng-Ru Lin, Ming-Syan Chen:
Constrained data clustering by depth control and progressive constraint relaxation. VLDB J. 16(2): 201-217 (2007) - Nilesh N. Dalvi, Dan Suciu:
Efficient query evaluation on probabilistic databases. VLDB J. 16(4): 523-544 (2007) - Antonios Deligiannakis, Yannis Kotidis, Nick Roussopoulos:
Dissemination of compressed historical information in sensor networks. VLDB J. 16(4): 439-461 (2007) - Amol Ghoting, Gregory Buehrer, Srinivasan Parthasarathy, Daehyun Kim, Anthony D. Nguyen, Yen-Kuang Chen, Pradeep Dubey:
Cache-conscious frequent pattern mining on modern and emerging processors. VLDB J. 16(1): 77-96 (2007) - Parke Godfrey, Ryan Shipley, Jarek Gryz:
Algorithms and analyses for maximal vector computation. VLDB J. 16(1): 5-28 (2007) - Laura M. Haas, Christian S. Jensen, Martin L. Kersten:
Special issue: best papers of VLDB 2005. VLDB J. 16(1): 1-3 (2007) - Florian Haftmann, Donald Kossmann, Eric Lo:
A framework for efficient regression tests on database applications. VLDB J. 16(1): 145-164 (2007) - Zhen He, Alonso Marquez:
Path and cache conscious prefetching (PCCP). VLDB J. 16(2): 235-249 (2007) - Christopher M. Jermaine, Edward Omiecinski, Wai Gen Yee:
The partitioned exponential file for database storage management. VLDB J. 16(4): 417-437 (2007) - Latifur Khan, Mamoun Awad, Bhavani Thuraisingham:
A new intrusion detection system using support vector machines and hierarchical clustering. VLDB J. 16(4): 507-521 (2007) - Christoph Koch, Stefanie Scherzinger:
Attribute grammars for scalable query processing on XML streams. VLDB J. 16(3): 317-342 (2007) - Per-Åke Larson, Jingren Zhou:
View matching for outer-join views. VLDB J. 16(1): 29-53 (2007) - Yoonkyong Lee, Mayssam Sayyadian, AnHai Doan, Arnon Rosenthal:
eTuner: tuning schema matching software using synthetic scenarios. VLDB J. 16(1): 97-122 (2007) - Jae-Gil Lee, Kyu-Young Whang, Wook-Shin Han, Il-Yeol Song:
The dynamic predicate: integrating access control with query processing in XML databases. VLDB J. 16(3): 371-387 (2007) - Volker Markl, Peter J. Haas, Marcel Kutsch, Nimrod Megiddo, Utkarsh Srivastava, Tam Minh Tran:
Consistent selectivity estimation via maximum entropy. VLDB J. 16(1): 55-76 (2007) - Mike P. Papazoglou, Willem-Jan van den Heuvel:
Service oriented architectures: approaches, technologies and research issues. VLDB J. 16(3): 389-415 (2007) - Heng Tao Shen, Xiaofang Zhou, Aoying Zhou:
An adaptive and dynamic dimensionality reduction method for high-dimensional indexing. VLDB J. 16(2): 219-234 (2007) - Egemen Tanin, Aaron Harwood, Hanan Samet:
Using a distributed quadtree index in peer-to-peer networks. VLDB J. 16(2): 165-178 (2007) - Yufei Tao, Dimitris Papadias, Xiang Lian, Xiaokui Xiao:
Multidimensional reverse k NN search. VLDB J. 16(3): 293-316 (2007) - Caetano Traina Jr., Roberto F. Santos Filho, Agma J. M. Traina, Marcos R. Vieira, Christos Faloutsos:
The Omni-family of all-purpose access methods: a simple and effective way to make similarity search more efficient. VLDB J. 16(4): 483-505 (2007) - José Ramon Rios Viqueira, Nikos A. Lorentzos:
SQL extension for spatio-temporal data. VLDB J. 16(2): 179-200 (2007) - John Yiannis, Justin Zobel:
Compression techniques for fast external sorting. VLDB J. 16(2): 269-291 (2007) - Hailing Yu, Divyakant Agrawal, Amr El Abbadi:
MEMS based storage architecture for relational databases. VLDB J. 16(2): 251-268 (2007)
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-23 13:40 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