Sciweavers

2889 search results - page 237 / 578
» Querying Structured Hyperdocuments
Sort
View
IC
2007
15 years 6 months ago
Native Temporal Slicing Support for XML Databases
Abstract XML databases, providing structural querying support, are becoming more and more popular. As we know, XML data may change over time and providing an efficient support to q...
Federica Mandreoli, Riccardo Martoglia, Enrico Ron...
148
Voted
AAAI
1990
15 years 6 months ago
Symbolic Probabilistic Inference in Belief Networks
The Symbolic Probabilistic Inference (SPI) Algorithm [D'Ambrosio, 19891 provides an efficient framework for resolving general queries on a belief network. It applies the conc...
Ross D. Shachter, Bruce D'Ambrosio, Brendan Del Fa...
CIKM
2010
Springer
15 years 2 months ago
Probabilistic ranking for relational databases based on correlations
This paper proposes a ranking method to exploit statistical correlations among pairs of attribute values in relational databases. For a given query, the correlations of the query ...
Jaehui Park, Sang-goo Lee
VLDB
2002
ACM
113views Database» more  VLDB 2002»
16 years 5 months ago
Searching in metric spaces by spatial approximation
We propose a new data structure to search in metric spaces. A metric space is formed by a collection of objects and a distance function de ned among them, which satis es the trian...
Gonzalo Navarro
ICC
2007
IEEE
116views Communications» more  ICC 2007»
15 years 11 months ago
Skip Tree Graph: a Distributed and Balanced Search Tree for Peer-to-Peer Networks
Abstract—Skip Tree Graph is a novel, distributed, data structure for peer-to-peer systems that supports exact-match and order-based queries such as range queries efficiently. It...
Alejandra González Beltrán, Paul Sag...