![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
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 30 matches
- 2003
- Charu C. Aggarwal, Dakshi Agrawal:
On nearest neighbor indexing of nonlinear trajectories. PODS 2003: 252-259 - Rakesh Agrawal:
Privacy in data systems. PODS 2003: 37 - Marcelo Arenas, Leonid Libkin:
An information-theoretic approach to normal forms for relational and XML data. PODS 2003: 15-26 - Brian Babcock, Mayur Datar, Rajeev Motwani, Liadan O'Callaghan:
Maintaining variance and k-medians over data stream windows. PODS 2003: 234-243 - Andreas Behrend:
Soft stratification for magic set based query evaluation in deductive databases. PODS 2003: 102-110 - Andrea Calì, Domenico Lembo, Riccardo Rosati:
On the decidability and complexity of query answering over inconsistent and incomplete databases. PODS 2003: 260-271 - Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini, Moshe Y. Vardi:
View-based query containment. PODS 2003: 56-67 - Rada Chirkova, Chen Li:
Materializing views with minimal size to answer queries. PODS 2003: 38-48 - Edith Cohen, Martin Strauss:
Maintaining time-decaying stream aggregates. PODS 2003: 223-233 - Graham Cormode
, S. Muthukrishnan:
What's hot and what's not: tracking most frequent items dynamically. PODS 2003: 296-306 - Irit Dinur
, Kobbi Nissim:
Revealing information while preserving privacy. PODS 2003: 202-210 - Jens-Peter Dittrich, Bernhard Seeger, David Scot Taylor, Peter Widmayer:
On producing join results early. PODS 2003: 134-142 - Alexandre V. Evfimievski, Johannes Gehrke, Ramakrishnan Srikant:
Limiting privacy breaches in privacy preserving data mining. PODS 2003: 211-222 - Ronald Fagin, Phokion G. Kolaitis, Lucian Popa:
Data exchange: getting to the core. PODS 2003: 90-101 - Minos N. Garofalakis, Amit Kumar:
Correlating XML data streams using tree-edit distance embeddings. PODS 2003: 143-154 - Georg Gottlob, Christoph Koch, Reinhard Pichler:
The complexity of XPath query evaluation. PODS 2003: 179-190 - Gösta Grahne, Alex Thomo
:
Query containment and rewriting using views for regular path queries under constraints. PODS 2003: 111-122 - David Gross-Amblard:
Query-preserving watermarking of relational databases and XML documents. PODS 2003: 191-201 - Ashish Kumar Gupta, Dan Suciu, Alon Y. Halevy:
The view selection problem for XML content based routing. PODS 2003: 68-77 - Cinda Heeren, H. V. Jagadish, Leonard Pitt:
Optimal indexing using near-minimal space. PODS 2003: 244-251 - Richard Hull, Michael Benedikt, Vassilis Christophides, Jianwen Su:
E-services: a look behind the curtain. PODS 2003: 1-14 - Yaron Kanza, Yehoshua Sagiv:
Computing full disjunctions. PODS 2003: 78-89 - Samir Khuller, Yoo Ah Kim, Yung-Chun (Justin) Wan:
Algorithms for data migration with cloning. PODS 2003: 27-36 - Daniel Kifer, Johannes Gehrke, Cristian Bucila, Walker M. White:
How to quickly find a witness. PODS 2003: 272-283 - Jens Lechtenbörger
:
The impact of the constant complement approach towards view updating. PODS 2003: 49-55 - Alberto O. Mendelzon, Ken Q. Pu:
Concise descriptions of subsets of structured sets. PODS 2003: 123-133 - Ganesh Ramesh, William Maniatty, Mohammed Javeed Zaki:
Feasible itemset distributions in data mining: theory and application. PODS 2003: 284-295 - Luc Segoufin:
Typing and querying XML documents: some complexity bounds. PODS 2003: 167-178 - Helmut Seidl, Thomas Schwentick, Anca Muscholl:
Numerical document queries. PODS 2003: 155-166 - Frank Neven, Catriel Beeri, Tova Milo:
Proceedings of the Twenty-Second ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 9-12, 2003, San Diego, CA, USA. ACM 2003, ISBN 1-58113-670-6 [contents]
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-07-02 15:37 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