Sciweavers

610 search results - page 15 / 122
» Efficient Query Evaluation on Probabilistic Databases
Sort
View
ICDE
2000
IEEE
161views Database» more  ICDE 2000»
15 years 1 months ago
Efficient Query Refinement in Multimedia Databases
Increasing application demands are pushing database management systems (DBMSs) towards providing adequate and efficient support for content-based retrieval over multimedia objects...
Kaushik Chakrabarti, Kriengkrai Porkaew, Sharad Me...
SIGMOD
2008
ACM
164views Database» more  SIGMOD 2008»
15 years 10 months ago
Finding frequent items in probabilistic data
Computing statistical information on probabilistic data has attracted a lot of attention recently, as the data generated from a wide range of data sources are inherently fuzzy or ...
Qin Zhang, Feifei Li, Ke Yi
SEBD
1996
94views Database» more  SEBD 1996»
14 years 11 months ago
Efficient Algorithm for determining the Optimal Execution Strategy for Path Queries in OODBS
Abstract. To select an optimal query evaluation strategy for a path query in an object-oriented database system one has to exploit the available index structures on the path. In a ...
Weimin Chen, Karl Aberer
PODS
2002
ACM
154views Database» more  PODS 2002»
15 years 10 months ago
How to Evaluate Multiple Range-Sum Queries Progressively
Decision support system users typically submit batches of range-sum queries simultaneously rather than issuing individual, unrelated queries. We propose a wavelet based technique ...
Rolfe R. Schmidt, Cyrus Shahabi
PVLDB
2010
146views more  PVLDB 2010»
14 years 4 months ago
Generating Efficient Execution Plans for Vertically Partitioned XML Databases
Experience with relational systems has shown that distribution is an effective way of improving the scalability of query evaluation. In this paper, we show how distributed query e...
Patrick Kling, M. Tamer Özsu, Khuzaima Daudje...