Sciweavers

591 search results - page 76 / 119
» The complexity of XPath query evaluation
Sort
View
SIGMOD
2012
ACM
212views Database» more  SIGMOD 2012»
11 years 11 months ago
Local structure and determinism in probabilistic databases
While extensive work has been done on evaluating queries over tuple-independent probabilistic databases, query evaluation over correlated data has received much less attention eve...
Theodoros Rekatsinas, Amol Deshpande, Lise Getoor
VLDB
2002
ACM
113views Database» more  VLDB 2002»
14 years 9 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
SAC
2009
ACM
14 years 3 months ago
Adaptive burst detection in a stream engine
Detecting bursts in data streams is an important and challenging task. Due to the complexity of this task, usually burst detection cannot be formulated using standard query operat...
Marcel Karnstedt, Daniel Klan, Christian Pöli...
VLDB
1992
ACM
120views Database» more  VLDB 1992»
14 years 21 days ago
An Information-Retrieval Approach for Image Databases
The retrieval process in image database systems is inherently different from the retrieval processin traditional (recordoriented)databasesystems.While thelatter canbe consideredan...
Fausto Rabitti, Pasquale Savino
DL
1995
Springer
14 years 6 days ago
Providing Government Information on the Internet: Experiences with THOMAS
The THOMAS system is designed to make legislative information available to the general public over the Internet, and can be regarded as a prototypeof a government digitallibrary. ...
W. Bruce Croft, Robert Cook, Dean Wilder