Sciweavers

2070 search results - page 87 / 414
» Querying Communities in Relational Databases
Sort
View
SIGMOD
2007
ACM
151views Database» more  SIGMOD 2007»
15 years 11 months ago
The case for a wide-table approach to manage sparse relational data sets
A "sparse" data set typically has hundreds or even thousands of attributes, but most objects have non-null values for only a small number of these attributes. A popular ...
Eric Chu, Jennifer L. Beckmann, Jeffrey F. Naughto...
SEKE
2007
Springer
15 years 5 months ago
Query Processing in Paraconsistent Databases in the Presence of Integrity Constraints
In this paper, we present an approach to query processing for paraconsistent databases in the presence of integrity constraints. Paraconsistent databases are capable of representi...
Navin Viswanath, Rajshekhar Sunderraman
COOPIS
2004
IEEE
15 years 2 months ago
Refresco: Improving Query Performance Through Freshness Control in a Database Cluster
Abstract. We consider the use of a cluster system for managing autonomous databases. In order to improve the performance of read-only queries, we strive to exploit user requirement...
Cécile Le Pape, Stéphane Ganç...
SIGMOD
2008
ACM
65views Database» more  SIGMOD 2008»
15 years 11 months ago
Generating targeted queries for database testing
Tools for generating test queries for databases do not explicitly take into account the actual data in the database. As a consequence, such tools cannot guarantee suitable coverag...
Chaitanya Mishra, Nick Koudas, Calisto Zuzarte
DEXAW
2009
IEEE
86views Database» more  DEXAW 2009»
15 years 5 months ago
Robust Service-Based Semantic Querying to Distributed Heterogeneous Databases
— The amount of semantic data on the Web has increased exponentially in the last years. One of the main reasons for this is the use of RDB2RDF systems, which generate RDF data fr...
Carlos Buil Aranda, Óscar Corcho, Amy Kraus...