Sciweavers

785 search results - page 18 / 157
» Efficient Processing of Top-k Queries in Uncertain Databases
Sort
View
DASFAA
2007
IEEE
205views Database» more  DASFAA 2007»
13 years 11 months ago
Efficient Support for Ordered XPath Processing in Tree-Unaware Commercial Relational Databases
Abstract. In this paper, we present a novel ordered XPATH evaluation in treeunaware RDBMS. The novelties of our approach lies in the followings. (a) We propose a novel XML storage ...
Boon-Siew Seah, Klarinda G. Widjanarko, Sourav S. ...
EDBT
2009
ACM
132views Database» more  EDBT 2009»
14 years 2 months ago
A novel approach for efficient supergraph query processing on graph databases
In recent years, large amount of data modeled by graphs, namely graph data, have been collected in various domains. Efficiently processing queries on graph databases has attracted...
Shuo Zhang, Jianzhong Li, Hong Gao, Zhaonian Zou
VLDB
2005
ACM
120views Database» more  VLDB 2005»
14 years 1 months ago
Efficiently Processing Queries on Interval-and-Value Tuples in Relational Databases
With the increasing occurrence of temporal and spatial data in present-day database applications, the interval data type is adopted by more and more database systems. For an effic...
Jost Enderle, Nicole Schneider, Thomas Seidl
53
Voted
SIGMOD
2007
ACM
125views Database» more  SIGMOD 2007»
14 years 7 months ago
Optimizing mpf queries: decision support and probabilistic inference
Managing uncertain data using probabilistic frameworks has attracted much interest lately in the database literature, and a central computational challenge is probabilistic infere...
Héctor Corrada Bravo, Raghu Ramakrishnan
TKDE
2010
251views more  TKDE 2010»
13 years 2 months ago
Exploring Correlated Subspaces for Efficient Query Processing in Sparse Databases
The sparse data is becoming increasingly common and available in many real-life applications. However, relative little attention has been paid to effectively model the sparse data ...
Bin Cui, Jiakui Zhao, Dongqing Yang