Sciweavers

2608 search results - page 30 / 522
» Inferring Answers to Queries
Sort
View
ICDE
2011
IEEE
233views Database» more  ICDE 2011»
13 years 1 months ago
Answering approximate string queries on large data sets using external memory
— An approximate string query is to find from a collection of strings those that are similar to a given query string. Answering such queries is important in many applications su...
Alexander Behm, Chen Li, Michael J. Carey
PODS
1999
ACM
160views Database» more  PODS 1999»
14 years 2 months ago
Queries with Incomplete Answers over Semistructured Data
Semistructured data occur in situations where information lacks a homogeneous structure and is incomplete. Yet, up to now the incompleteness of information has not been re ected b...
Yaron Kanza, Werner Nutt, Yehoshua Sagiv
VLDB
2005
ACM
117views Database» more  VLDB 2005»
14 years 3 months ago
Data Sharing in the Hyperion Peer Database System
This demo presents Hyperion, a prototype system that supports data sharing for a network of independent Peer Relational Database Management Systems (PDBMSs). The nodes of such a n...
Patricia Rodríguez-Gianolli, Maddalena Garz...
CIKM
2009
Springer
14 years 2 months ago
Answering XML queries using materialized views revisited
Answering queries using views is a well-established technique in databases. In this context, two outstanding problems can be formulated. The first one consists in deciding whethe...
Xiaoying Wu, Dimitri Theodoratos, Wendy Hui Wang
VLDB
2006
ACM
147views Database» more  VLDB 2006»
14 years 10 months ago
Answering queries using materialized views with minimum size
In this paper we study the following problem. Given a database and a set of queries, we want to find a set of views that can compute the answers to the queries, such that the amoun...
Rada Chirkova, Chen Li, Jia Li