PODS
1995
ACM
13 years 11 months ago
1995
ACM
PODS
1995
ACM
13 years 11 months ago
1995
ACM
PODS
1995
ACM
13 years 11 months ago
1995
ACM
d abstract Marc Andries, Leiden University Luca Cabibbo, University of Romey Jan Paredaens, University of Antwerpz Jan Van den Bussche, INRIAx In the context of object databases...
VLDB
1997
ACM
13 years 11 months ago
1997
ACM
A new access method, called M-tree, is proposed to organize and search large data sets from a generic "metric space", i.e. where object proximity is only defined by a di...
VLDB
1997
ACM
13 years 11 months ago
1997
ACM
TheMicrosoft Repositoryis anobject-orientedrepository thatshipsasacomponentof Visual Basic(Version 5.0). It includesasetof ActiveX interfacesthat adeveloper canuseto defineinforma...
KDD
1995
ACM
13 years 11 months ago
1995
ACM
This paper introduces a new measurement, robustness, to measure the quality of machine-discovered knowledge from real-world databases that change over time. A piece of knowledge i...
KDD
1995
ACM
13 years 11 months ago
1995
ACM
For semantic query optimization one needs detailed knowledgeabout the contents of the database. Traditional techniquesuse static knowledgeabout all possible states of the database...
SIGMOD
1997
ACM
13 years 11 months ago
1997
ACM
The Partitioned Based Spatial-Merge Join (PBSM) of Patel and DeWitt and the Size Separation Spatial Join (S3 J) of Koudas and Sevcik are considered to be among the most efficient ...
ICDT
1995
ACM
13 years 11 months ago
1995
ACM
Following results are sketched in this extended abstract: (1) Datalog recursive programs where each rule has at most one subgoal called unit recursions are shown to be bounded, wit...
ICDT
1995
ACM
13 years 11 months ago
1995
ACM
We investigate and compare two forms of recursion on sets for querying nested collections. The rst one is called sri and it corresponds to sequential processing of data. The second...