Остановите войну!
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
- 2006
- Gagan Aggarwal, Tomás Feder, Krishnaram Kenthapadi, Samir Khuller, Rina Panigrahy, Dilys Thomas, An Zhu:
Achieving anonymity via clustering. PODS 2006: 153-162 - Michael A. Bender, Martin Farach-Colton, Bradley C. Kuszmaul:
Cache-oblivious string B-trees. PODS 2006: 233-242 - Michael A. Bender, Haodong Hu:
An adaptive packed-memory array. PODS 2006: 20-29 - Aaron Bohannon, Benjamin C. Pierce, Jeffrey A. Vaughan:
Relational lenses: a language for updatable views. PODS 2006: 338-347 - Mikolaj Bojanczyk, Claire David, Anca Muscholl, Thomas Schwentick, Luc Segoufin:
Two-variable logic on data trees and XML reasoning. PODS 2006: 10-19 - Luciana S. Buriol, Gereon Frahling, Stefano Leonardi, Alberto Marchetti-Spaccamela, Christian Sohler:
Counting triangles in data streams. PODS 2006: 253-262 - Toon Calders, Stijn Dekeyser, Jan Hidders, Jan Paredaens:
Analyzing workflows implied by instance-dependent access rules. PODS 2006: 100-109 - Balder ten Cate:
The expressivity of XPath with transitive closure. PODS 2006: 328-337 - Sara Cohen:
Equivalence of queries combining set and bag-set semantics. PODS 2006: 70-79 - Anne Condon, Amol Deshpande, Lisa Hellerstein, Ning Wu:
Flow algorithms for two pipelined filter ordering problems. PODS 2006: 193-202 - Graham Cormode, Flip Korn, S. Muthukrishnan, Divesh Srivastava:
Space- and time-efficient deterministic algorithms for biased quantiles over data streams. PODS 2006: 263-272 - Alin Deutsch, Liying Sui, Victor Vianu, Dayou Zhou:
Verification of communicating data-driven web services. PODS 2006: 90-99 - Ronald Fagin:
Inverting schema mappings. PODS 2006: 50-59 - Enrico Franconi, Sergio Tessaris:
The logic of RDF and SPARQL: a tutorial. PODS 2006: 355 - Sumit Ganguly, Anirban Majumder:
Deterministic k-set structure. PODS 2006: 280-289 - Ashish Goel, Sudipto Guha, Kamesh Munagala:
Asking the right questions: model-driven optimization using probes. PODS 2006: 203-212 - Sreenivas Gollapudi, Ravi Kumar, D. Sivakumar:
Programmable clustering. PODS 2006: 348-354 - Georg Gottlob, Alan Nash:
Data exchange: computing cores in polynomial time. PODS 2006: 40-49 - Georg Gottlob, Reinhard Pichler, Fang Wei:
Tractable database design through bounded treewidth. PODS 2006: 124-133 - Martin Grohe, André Hernich, Nicole Schweikardt:
Randomized computations on large data sets: tight lower bounds. PODS 2006: 243-252 - Sudipto Guha, Andrew McGregor:
Approximate quantiles and the order of the stream. PODS 2006: 273-279 - Marc Gyssens, Jan Paredaens, Dirk Van Gucht, George H. L. Fletcher:
Structural characterizations of the semantics of XPath as navigation tool on a document. PODS 2006: 318-327 - Alon Y. Halevy, Michael J. Franklin, David Maier:
Principles of dataspace systems. PODS 2006: 1-9 - Joseph Y. Halpern:
From statistical knowledge bases to degrees of belief: an overview. PODS 2006: 110-113 - T. S. Jayram, Phokion G. Kolaitis, Erik Vee:
The containment problem for REAL conjunctive queries with inequalities. PODS 2006: 80-89 - Srinivas R. Kashyap, Supratim Deb, K. V. M. Naidu, Rajeev Rastogi, Anand Srinivasan:
Efficient gossip-based aggregate computation. PODS 2006: 308-317 - Benny Kimelfeld, Yehoshua Sagiv:
Finding and approximating top-k answers in keyword proximity search. PODS 2006: 173-182 - Christoph Koch:
Processing queries on tree-structured data efficiently. PODS 2006: 213-224 - Solmaz Kolahi, Leonid Libkin:
On redundancy vs dependency preservation in normalization: an information-theoretic study of 3NF. PODS 2006: 114-123 - Phokion G. Kolaitis, Jonathan Panttaja, Wang Chiew Tan:
The complexity of data exchange. PODS 2006: 30-39
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-06-04 18:00 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