Sciweavers

813 search results - page 22 / 163
» Languages for Relational Databases over Interpreted Structur...
Sort
View
PPDP
2007
Springer
14 years 1 months ago
Formalizing and verifying semantic type soundness of a simple compiler
We describe a semantic type soundness result, formalized in the Coq proof assistant, for a compiler from a simple imperative language with heap-allocated data into an idealized as...
Nick Benton, Uri Zarfaty
BTW
2007
Springer
133views Database» more  BTW 2007»
13 years 11 months ago
Pathfinder: XQuery Compila-tion Techniques for Relational Database Targets
: Relational database systems are highly efficient hosts to table-shaped data. It is all the more interesting to see how a careful inspection of both, the XML tree structure as wel...
Jens Teubner
LWA
2004
13 years 8 months ago
Efficient Frequent Pattern Mining in Relational Databases
Data mining on large relational databases has gained popularity and its significance is well recognized. However, the performance of SQL based data mining is known to fall behind ...
Xuequn Shang, Kai-Uwe Sattler, Ingolf Geist
CIKM
2006
Springer
13 years 11 months ago
Information retrieval from relational databases using semantic queries
Relational databases are widely used today as a mechanism for providing access to structured data. They, however, are not suitable for typical information finding tasks of end use...
Anand Ranganathan, Zhen Liu
ER
2004
Springer
163views Database» more  ER 2004»
13 years 11 months ago
From Ontology to Relational Databases
The semantic web envisions a World Wide Web in which data is described with rich semantics and applications can pose complex queries. Ontologies, a cornerstone of the semantic web,...
Anuradha Gali, Cindy X. Chen, Kajal T. Claypool, R...