]> BibSonomy publications for /author/Abiteboul http://www.bibsonomy.org/burst/author/Abiteboul BibSonomy BuRST Feed for /author/Abiteboul 2008-07-27T02:26:10+02:00 The Active XML project: an overview. dblphttp://www.bibsonomy.org/bibtex/27e067897b5ecef11d998a1c0061a23f7/dblp dblp 2008-07-14T00:00:00+02:00 dblp
The Active XML project: an overview.
Serge Abiteboul and Omar Benjelloun and Tova Milo VLDB J. 17 1019-1040 (2008)
to dblp by dblp on 2008-07-14 00:00:00 ]]> VLDB J.51019-1040The Active XML project: an overview.172008dblp 2008-07-14 00:00:00.0 Static analysis of active XML systems. dblphttp://www.bibsonomy.org/bibtex/225a966bb37e1c295f37272dcf781dcfa/dblp dblp 2008-06-10T00:00:00+02:00 dblp
Static analysis of active XML systems.
Serge Abiteboul and Luc Segoufin and Victor Vianu PODS 221-230 (2008)
to dblp by dblp on 2008-06-10 00:00:00 ]]> PODSconf/pods/2008221-230Static analysis of active XML systems.2008dblp 2008-06-10 00:00:00.0 Calculus and Algebra for Distributed Data Management. dblphttp://www.bibsonomy.org/bibtex/2a98a8e0cf7d1ab9353a9188f5c4b08fa/dblp dblp 2008-05-19T00:00:00+02:00 dblp
Calculus and Algebra for Distributed Data Management.
Serge Abiteboul Programming Paradigms for the Web: Web Programming and Web Services (2007)
to dblp by dblp on 2008-05-19 00:00:00 ]]> Programming Paradigms for the Web: Web Programming and Web Servicesconf/dagstuhl/2007P7051Dagstuhl Seminar ProceedingsCalculus and Algebra for Distributed Data Management.070512007dblp 2008-05-19 00:00:00.0 OptimAX: efficient support for data-intensive mash-ups. dblphttp://www.bibsonomy.org/bibtex/2e2dc407daa00b609678e1a4918eee0f6/dblp dblp 2008-05-14T00:00:00+02:00 dblp
OptimAX: efficient support for data-intensive mash-ups.
Serge Abiteboul and Ioana Manolescu and Spyros Zoupanos ICDE 1564-1567 (2008)
to dblp by dblp on 2008-05-14 00:00:00 ]]> ICDEconf/icde/20081564-1567OptimAX: efficient support for data-intensive mash-ups.2008dblp 2008-05-14 00:00:00.0 XML processing in DHT networks. dblphttp://www.bibsonomy.org/bibtex/2d166c26187df4f8277e9ed99b2a5f0c7/dblp dblp 2008-05-05T00:00:00+02:00 dblp
XML processing in DHT networks.
Serge Abiteboul and Ioana Manolescu and Neoklis Polyzotis and Nicoleta Preda and Chong Sun ICDE 606-615 (2008)
to dblp by dblp on 2008-05-05 00:00:00 ]]> ICDEconf/icde/2008606-615XML processing in DHT networks.2008dblp 2008-05-05 00:00:00.0 Distributed Monitoring of Peer-to-Peer Systems. dblphttp://www.bibsonomy.org/bibtex/28c4b1399a851819655772e63f5e69466/dblp dblp 2008-05-05T00:00:00+02:00 dblp
Distributed Monitoring of Peer-to-Peer Systems.
Serge Abiteboul and Bogdan Marinoiu and Pierre Bourhis ICDE 1572-1575 (2008)
to dblp by dblp on 2008-05-05 00:00:00 ]]> ICDEconf/icde/20081572-1575Distributed Monitoring of Peer-to-Peer Systems.2008dblp 2008-05-05 00:00:00.0 Tools for Data Translation and Integration. dblphttp://www.bibsonomy.org/bibtex/2b275b61bbe7c739269beeaf2dfb15b10/thau thau 2008-04-11T20:50:28+02:00 data integration translation
Tools for Data Translation and Integration.
Serge Abiteboul and Sophie Cluet and Tova Milo and Pini Mogilevsky and Jérôme Siméon and Sagit Zohar IEEE Data Eng. Bull. 22 3-8 (1999)
to data integration translation by thau on 2008-04-11 20:50:28 ]]> IEEE Data Eng. Bull.13-8Tools for Data Translation and Integration.221999data integration translation 2008-04-11 20:50:28.0 Deep equality revisited SpringerLink - Book Chapterhttp://www.bibsonomy.org/bibtex/24c465472440aae13ab201183a10fe613/ludaesch ludaesch 2008-04-02T09:12:51+02:00 165b
Deep equality revisited
Serge Abiteboul and Jan Van den Bussche Deductive and Object-Oriented Databases 213--228 (1995)
to 165b by ludaesch on 2008-04-02 09:12:51 ]]> Deductive and Object-Oriented Databases213--228Deep equality revisited1995165b 2008-04-02 09:12:51.0We revisit the notion of deep equality among objects in an object database from a formal point of view. We present three natural formalizations of deep equality: one based on the infinite value-trees associated with objects, one based on the greatest fixpoint of an operator on equivalence relations among objects, and one based on indistinguishability of objects using observations of atomic values reachable from the objects. These three definitions are then shown to be equivalent. The characterization in terms of greatest fixpoints also yields a polynomial-time algorithm for checking deep equality. We also study the expressibility of deep equality in deductive database languages. ER - The Lorel Query Language for Semistructured Data http://www.bibsonomy.org/bibtex/2eb0ad9c1047339e518a52021e353496e/diego_ma diego_ma 2008-02-25T04:42:49+01:00 computer
The Lorel Query Language for Semistructured Data
Serge Abiteboul and Dallan Quass and Jason McHugh and Jennifer Widom and Janet L. Wiener International Journal on Digital Libraries (1997)
to computer by diego_ma on 2008-02-25 04:42:49 ]]> International Journal on Digital LibrariesThe {Lorel} Query Language for Semistructured Data1997computer 2008-02-25 04:42:49.0We present the Lorel language, designed for querying semistructured data. Semistructured data is becoming more and more prevalent, e.g., in structured documents such as HTML and when performing simple integration of data from multiple sources. Traditional data models and query languages are inappropriate, since semistructured data often is irregular, some data is missing, similar concepts are represented using different types, heterogeneous sets are present, or object structure is not fully known. Lorel is a user-friendly language in the SQL/OQL style for querying such data effectively. For wide applicability, the simple object model underlying Lorel can be viewed as an extension of ODMG and the language as an extension of OQL. The main novelties of the Lorel language are: (i) extensive use of coercion to relieve the user from the strict typing of OQL, which is inappropriate for semistructured data; and (ii) powerful path expressions, which permit a flexible form of declarative navigational access and are particularly suitable when the details of the structure are not known to the user. Lorel also includes a declarative update language. Lorel is implemented as the query language of the Lore prototype database management system at Stanford (see http://www-db.stanford.edu/lore). In addition to presenting the Lorel language in full, this paper briefly describes the Lore system and query processor. We also discuss how Lorel could be implemented on top of a conventional object-oriented database management system. On-Line Index Selection for Shifting Workloads. dblphttp://www.bibsonomy.org/bibtex/275b5e536ba0ed589a12fdf3839f00d9f/dblp dblp 2008-01-16T00:00:00+01:00 dblp
On-Line Index Selection for Shifting Workloads.
Karl Schnaitter and Serge Abiteboul and Tova Milo and Neoklis Polyzotis ICDE Workshops 459-468 (2007)
to dblp by dblp on 2008-01-16 00:00:00 ]]> ICDE Workshopsconf/icde/2007w459-468On-Line Index Selection for Shifting Workloads.2007dblp 2008-01-16 00:00:00.0