default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJean-Pierre Cheiney
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1995
[c21]Jean-Pierre Cheiney, Vincent Oria:
Spatial Database Querying with Logic Languages. DASFAA 1995: 342-349- 1994
- [j1]Jean-Pierre Cheiney, Yan-Nong Huang:
Efficient Maintenance of Explicit Transitive Closures with Set-Oriented Update Propagation and Parallel Processing. Data Knowl. Eng. 13(3): 197-220 (1994) - [c20]Jean-Pierre Cheiney, Vincent Oria:
Prolo-Palo, un langage logique pour Bases de Données Spatiales. BDA 1994 - 1993
- [c19]Jean-Pierre Cheiney, Gerald Kiernan, Christophe de Maindreville:
A Database Rule Language Compiler Supporting Parallelism. DASFAA 1993: 279-286 - 1992
- [c18]Yan-Nong Huang, Sérgio Lifschitz, Jean-Pierre Cheiney:
Aggregates over transitively closed relations. BDA 1992: 220- - [c17]A. Touir, Jean-Pierre Cheiney:
In Integrating Content-Oriented Knowledge Model. DEXA 1992: 550 - [c16]Jean-Pierre Cheiney, Rosana S. G. Lanzelotte
:
A Model for Optimizing Deductive and Object-Oriented DB Requests. ICDE 1992: 385-392 - 1991
- [c15]Jean-Pierre Cheiney, Yan-Nong Huang:
Maintien différentiel ensembliste de fermetures transitives. BDA 1991: 367- - [c14]Rosana S. G. Lanzelotte, Jean-Pierre Cheiney:
Adapting Relational Optimization Technology to Deductive and Object-Oriented Declarative Database Languages. DBPL 1991: 322-336 - [c13]Rosana S. G. Lanzelotte, Patrick Valduriez, Mikal Ziane, Jean-Pierre Cheiney:
Optimization of Nonrecursive Queries in OODBs. DOOD 1991: 1-21 - [c12]Jean-Pierre Cheiney, Yan-Nong Huang:
Set-Oriented Propagation of Updates into Transitively Closed Relations. DOOD 1991: 503-523 - [c11]Yan-Nong Huang, Jean-Pierre Cheiney:
Parallel Computation of Direct Transitive Closures. ICDE 1991: 192-199 - [c10]Jean-Pierre Cheiney, Philippe Picouet:
Digital prefix coding trees: an efficient structure for image data storage and manipulation. RIAO 1991: 885-901 - [c9]Jean-Pierre Cheiney, A. Touir:
FI-Quadtree: A New Data Structure for Content-Oriented Retrieval and Fuzzy Search. SSD 1991: 23-32 - 1990
- [c8]Yan-Nong Huang, Jean-Pierre Cheiney:
Implantation parallèle de fermetures transitives directes. BDA 1990: 339- - [c7]Jean-Pierre Cheiney, Christophe de Maindreville:
A Parallel Strategy for Transitive Closure usind Double Hash-Based Clustering. VLDB 1990: 347-358
1980 – 1989
- 1989
- [c6]Jean-Pierre Cheiney, Christophe de Maindreville:
Relational Storage and Efficient Retrieval of Rules in a Deductive DBMS. ICDE 1989: 644-651 - [c5]Jean-Pierre Cheiney, Christophe de Maindreville:
A Parallel Transitive Closure Algorithm Using Hash-Based Clustering. IWDM 1989: 301-316 - [c4]Georges Gardarin, Jean-Pierre Cheiney, Gerald Kiernan, Dominique Pastre, Hervé Stora:
Managing Complex Objects in an Extensible Relational DBMS. VLDB 1989: 55-65 - 1988
- [c3]Jean-Pierre Cheiney, Gerald Kiernan:
A Functional Clustering Method for Optimal Access to Complex Domains in a Relational DBMS. ICDE 1988: 394-401 - 1986
- [c2]Jean-Pierre Cheiney, Pascal Faudemay, Rodolphe Michel:
An Extension of Access Paths to Improve Joins and Selections. ICDE 1986: 270-280 - [c1]Jean-Pierre Cheiney, Pascal Faudemay, Rodolphe Michel, Jean-Marc Thévenin:
A Reliable Backend Using Multiattribute Clustering and Select-Join Operator. VLDB 1986: 220-227
Coauthor Index
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.
last updated on 2024-05-08 21:00 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
