Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "extensional database"
@inproceedings{DBLP:conf/pods/Monet20, author = {Mika{\"{e}}l Monet}, title = {Solving a Special Case of the Intensional vs Extensional Conjecture in Probabilistic Databases}, booktitle = {{PODS}}, pages = {149--163}, publisher = {{ACM}}, year = {2020} }
@article{DBLP:journals/corr/abs-1912-11864, author = {Mika{\"{e}}l Monet}, title = {Solving a Special Case of the Intensional vs Extensional Conjecture in Probabilistic Databases}, journal = {CoRR}, volume = {abs/1912.11864}, year = {2019} }
@article{DBLP:journals/isci/QinW11, author = {Biao Qin and Shan Wang}, title = {Combining intensional with extensional query evaluation in tuple independent probabilistic databases}, journal = {Inf. Sci.}, volume = {181}, number = {4}, pages = {812--831}, year = {2011} }
@inproceedings{DBLP:conf/edbt/JhaOS10, author = {Abhay Kumar Jha and Dan Olteanu and Dan Suciu}, title = {Bridging the gap between intensional and extensional query evaluation in probabilistic databases}, booktitle = {{EDBT}}, series = {{ACM} International Conference Proceeding Series}, volume = {426}, pages = {323--334}, publisher = {{ACM}}, year = {2010} }
@incollection{DBLP:reference/db/X09ug, title = {Extensional Relational Database {(ERDB)}}, booktitle = {Encyclopedia of Database Systems}, pages = {1095}, publisher = {Springer {US}}, year = {2009} }
@inproceedings{DBLP:conf/jit/NeilingSS02, author = {Mattis Neiling and Markus Schaal and Martin Schumann}, title = {WrapIt : Automated Integration of Web Databases with Extensional Overlaps}, booktitle = {Web, Web-Services, and Database Systems}, series = {Lecture Notes in Computer Science}, volume = {2593}, pages = {184--198}, publisher = {Springer}, year = {2002} }
@article{DBLP:journals/dke/PalopoliPTU00, author = {Luigi Palopoli and Luigi Pontieri and Giorgio Terracina and Domenico Ursino}, title = {Intensional and extensional integration and abstraction of heterogeneous databases}, journal = {Data Knowl. Eng.}, volume = {35}, number = {3}, pages = {201--237}, year = {2000} }
@inproceedings{DBLP:conf/dagstuhl/Flach98, author = {Peter A. Flach}, title = {From Extensional to Intensional Knowledge: Inductive Logic Programming Techniques and Their Application to Deductive Databases}, booktitle = {Transactions and Change in Logic Databases}, series = {Lecture Notes in Computer Science}, volume = {1472}, pages = {356--387}, publisher = {Springer}, year = {1998} }
@inproceedings{DBLP:conf/dood/Flach97, author = {Peter A. Flach}, title = {Inductive Logic Databases: From Extensional to Intensional Knowledge}, booktitle = {{DOOD}}, series = {Lecture Notes in Computer Science}, volume = {1341}, pages = {3}, publisher = {Springer}, year = {1997} }
@inproceedings{DBLP:conf/dexaw/SaoudiNB96, author = {Abdellatif Saoudi and Gilles Nachouki and Henri Briand}, title = {Checking Extensional Constraints of Federated Databases}, booktitle = {{DEXA} Workshop}, pages = {398--403}, publisher = {{IEEE} Computer Society}, year = {1996} }
@inproceedings{DBLP:conf/sebd/CastroGS95, author = {Cristina De Castro and Fabio Grandi and Maria Rita Scalas}, title = {Extensional Data Management in Multitemporal Relational Databases Supporting Schema Versioning}, booktitle = {{SEBD}}, pages = {365--384}, year = {1995} }
@inproceedings{DBLP:conf/er/Manino90, author = {Michael V. Mannino}, title = {Extensional/Intensional Database Systems}, booktitle = {{ER}}, pages = {65--66}, publisher = {{ER} Institute}, year = {1990} }
@inproceedings{DBLP:conf/eds/ShumM88, author = {Chung{-}Dak Shum and Richard R. Muntz}, title = {Implicit Representation for Extensional Answers}, booktitle = {Expert Database Conf}, pages = {497--522}, publisher = {Benjamin/Cummings}, year = {1988} }
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.