Sciweavers

610 search results - page 32 / 122
» Efficient Query Evaluation on Probabilistic Databases
Sort
View
119
Voted
CIKM
1994
Springer
15 years 4 months ago
Using Path Information for Query Processing in Object-Oriented Database Systems
This paper argues that most queries in object-oriented databases require traversing from one object to another in the aggregation hierarchy. Thus, the connections between objects ...
Dik Lun Lee, Wang-Chien Lee
138
Voted
WEBDB
2010
Springer
208views Database» more  WEBDB 2010»
14 years 10 months ago
XML-Based RDF Data Management for Efficient Query Processing
The Semantic Web, which represents a web of knowledge, offers new opportunities to search for knowledge and information. To harvest such search power requires robust and scalable ...
Mo Zhou, Yuqing Wu
112
Voted
EDBT
2009
ACM
173views Database» more  EDBT 2009»
15 years 5 months ago
PROUD: a probabilistic approach to processing similarity queries over uncertain data streams
We present PROUD - A PRObabilistic approach to processing similarity queries over Uncertain Data streams, where the data streams here are mainly time series streams. In contrast t...
Mi-Yen Yeh, Kun-Lung Wu, Philip S. Yu, Ming-Syan C...
SSDBM
2006
IEEE
122views Database» more  SSDBM 2006»
15 years 6 months ago
Probabilistic Ranking Queries on Gaussians
In many modern applications, there are no exact values available to describe the data objects. Instead, the feature values are considered to be uncertain. This uncertainty is mode...
Christian Böhm, Alexey Pryakhin, Matthias Sch...
122
Voted
DPD
2002
168views more  DPD 2002»
15 years 9 days ago
Evolutionary Algorithms for Allocating Data in Distributed Database Systems
A major cost in executing queries in a distributed database system is the data transfer cost incurred in transferring relations (fragments) accessed by a query from different sites...
Ishfaq Ahmad, Kamalakar Karlapalem, Yu-Kwong Kwok,...