Sciweavers

448 search results - page 20 / 90
» Queries and Constraints on Semi-structured Data
Sort
View
95
Voted
EDBT
2008
ACM
146views Database» more  EDBT 2008»
14 years 11 months ago
SPARQLing constraints for RDF
The goal of the Semantic Web is to support semantic interoperability between applications exchanging data on the web. The idea heavily relies on data being made available in machi...
Georg Lausen, Michael Meier 0002, Michael Schmidt
KDD
2004
ACM
139views Data Mining» more  KDD 2004»
15 years 10 months ago
Machine learning for online query relaxation
In this paper we provide a fast, data-driven solution to the failing query problem: given a query that returns an empty answer, how can one relax the query's constraints so t...
Ion Muslea
DAWAK
2001
Springer
15 years 2 months ago
Shared Index Scans for Data Warehouses
Tree based indexing structures like -trees, ·-trees, Bitmap indexes and Ê-trees have become essential for getting good performance when accessing vast datasets. However, most dat...
Yannis Kotidis, Yannis Sismanis, Nick Roussopoulos
60
Voted
WWW
2004
ACM
15 years 10 months ago
A query algebra for xml p2p databases
This paper describes a query algebra for queries over XML p2p databases that provides explicit mechanisms for modeling data dissemination, replication constraints, and for capturi...
Carlo Sartiani
DAISD
1994
104views more  DAISD 1994»
14 years 11 months ago
Validating Constraints with Partial Information: Research Overview
We are interested in the problem of validating the consistency of integrity constraints when data is modi ed. In particular, we consider how constraints can be checked with only p...
Jennifer Widom, Ashish Gupta, Yehoshua Sagiv, Jeff...