2635 search results - page 300 / 527 » Algorithms for the Database Layout Problem |
158
click to vote
EDBT
2009
ACM
16 years 1 months ago
2009
ACM
The largeness and the heterogeneity of most graph-modeled datasets in several database application areas make the query process a real challenge because of the lack of a complete ...
168
click to vote
WEBDB
2009
Springer
16 years 1 months ago
2009
Springer
We study the problem of schema evolution in the RDF data model. RDF and the RDFS schema language are W3C standards for flexibly modeling and sharing data on the web. Although sch...
200
click to vote
FOIKS
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. We give a general framework for approximate query processing in semistructured databases. We focus on regular path queries, which are the integral part of most of the que...
196
click to vote
KDD
2004
ACM
15 years 12 months ago
2004
ACM
Randomization is an economical and efficient approach for privacy preserving data mining (PPDM). In order to guarantee the performance of data mining and the protection of individ...
167
click to vote
SIGMOD
1999
ACM
15 years 11 months ago
1999
ACM
In large data warehousing environments, it is often advantageous to provide fast, approximate answers to complex aggregate queries based on statistical summaries of the full data....