Sciweavers

PODS
1995
ACM
94views Database» more  PODS 1995»
14 years 3 months ago
Answering Queries Using Views
Alon Y. Levy, Alberto O. Mendelzon, Yehoshua Sagiv...
PODS
1995
ACM
75views Database» more  PODS 1995»
14 years 3 months ago
The Size of a Revised Knowledge Base
Marco Cadoli, Francesco M. Donini, Paolo Liberator...
PODS
1995
ACM
120views Database» more  PODS 1995»
14 years 3 months ago
Applying an Update Method to a Set of Receivers
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...
Marc Andries, Luca Cabibbo, Jan Paredaens, Jan Van...
VLDB
1997
ACM
170views Database» more  VLDB 1997»
14 years 3 months ago
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces
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...
Paolo Ciaccia, Marco Patella, Pavel Zezula
VLDB
1997
ACM
121views Database» more  VLDB 1997»
14 years 3 months ago
The Microsoft Repository
TheMicrosoft Repositoryis anobject-orientedrepository thatshipsasacomponentof Visual Basic(Version 5.0). It includesasetof ActiveX interfacesthat adeveloper canuseto defineinforma...
Philip A. Bernstein, Brian Harry, Paul Sanders, Da...
KDD
1995
ACM
85views Data Mining» more  KDD 1995»
14 years 3 months ago
Estimating the Robustness of Discovered Knowledge
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...
Chun-Nan Hsu, Craig A. Knoblock
KDD
1995
ACM
140views Data Mining» more  KDD 1995»
14 years 3 months ago
Discovery and Maintenance of Functional Dependencies by Independencies
For semantic query optimization one needs detailed knowledgeabout the contents of the database. Traditional techniquesuse static knowledgeabout all possible states of the database...
Siegfried Bell
SIGMOD
1997
ACM
113views Database» more  SIGMOD 1997»
14 years 3 months ago
Size Separation Spatial Join
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 ...
Nick Koudas, Kenneth C. Sevcik
ICDT
1995
ACM
91views Database» more  ICDT 1995»
14 years 3 months ago
Some Positive Results for Boundedness of Multiple Recursive Rules
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...
Ke Wang
ICDT
1995
ACM
96views Database» more  ICDT 1995»
14 years 3 months ago
On Two Forms of Structural Recursion
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...
Dan Suciu, Limsoon Wong