Sciweavers

ICDE
2010
IEEE
248views Database» more  ICDE 2010»
14 years 4 months ago
Similarity Search on Supergraph Containment
A supergraph containment search is to retrieve the data graphs contained by a query graph. In this paper, we study the problem of efficiently retrieving all data graphs approximate...
Haichuan Shang, Ke Zhu, Xuemin Lin, Ying Zhang, Ry...
EDBT
2002
ACM
188views Database» more  EDBT 2002»
14 years 4 months ago
Approximate Processing of Multiway Spatial Joins in Very Large Databases
Existing work on multiway spatial joins focuses on the retrieval of all exact solutions with no time limit for query processing. Depending on the query and data properties, however...
Dimitris Papadias, Dinos Arkoumanis
PODS
2008
ACM
250views Database» more  PODS 2008»
14 years 4 months ago
Approximating predicates and expressive queries on probabilistic databases
We study complexity and approximation of queries in an expressive query language for probabilistic databases. The language studied supports the compositional use of confidence com...
Christoph Koch
PODS
2004
ACM
115views Database» more  PODS 2004»
14 years 4 months ago
Foundations of Semantic Web Databases
The Semantic Web is based on the idea of adding more machine-readable semantics to web information via annotations written in a language called the Resource Description Framework ...
Claudio Gutiérrez, Carlos A. Hurtado, Alber...
SIGMOD
2007
ACM
196views Database» more  SIGMOD 2007»
14 years 5 months ago
GPUQP: query co-processing using graphics processors
We present GPUQP, a relational query engine that employs both CPUs and GPUs (Graphics Processing Units) for in-memory query co-processing. GPUs are commodity processors traditiona...
Rui Fang, Bingsheng He, Mian Lu, Ke Yang, Naga K. ...
SIGMOD
2007
ACM
169views Database» more  SIGMOD 2007»
14 years 5 months ago
Scalable approximate query processing with the DBO engine
This paper describes query processing in the DBO database system. Like other database systems designed for ad-hoc, analytic processing, DBO is able to compute the exact answer to ...
Christopher M. Jermaine, Subramanian Arumugam, Abh...
SIGMOD
2008
ACM
145views Database» more  SIGMOD 2008»
14 years 5 months ago
Optimizing complex queries with multiple relation instances
Today's query processing engines do not take advantage of the multiple occurrences of a relation in a query to improve performance. Instead, each instance is treated as a dis...
Yu Cao, Gopal C. Das, Chee Yong Chan, Kian-Lee Tan
SIGMOD
2008
ACM
151views Database» more  SIGMOD 2008»
14 years 5 months ago
The DBO database system
We demonstrate our prototype of the DBO database system. DBO is designed to facilitate scalable analytic processing over large data archives. DBO's analytic processing perfor...
Florin Rusu, Fei Xu, Luis Leopoldo Perez, Mingxi W...
VLDB
2007
ACM
99views Database» more  VLDB 2007»
14 years 5 months ago
The dynamic predicate: integrating access control with query processing in XML databases
Jae-Gil Lee, Kyu-Young Whang, Wook-Shin Han, Il-Ye...
ICDE
2000
IEEE
109views Database» more  ICDE 2000»
14 years 6 months ago
Distributed Query Processing on the Web
Nalin Gupta, Jayant R. Haritsa, Maya Ramanath