3311 search results - page 397 / 663 » Modeling Relational Data by the Adjacency Model |
206
click to vote
VLDB
2005
ACM
16 years 1 days ago
2005
ACM
Developing cost models for query optimization is significantly harder for XML queries than for traditional relational queries. The reason is that XML query operators are much mor...
171
click to vote
SAC
2009
ACM
16 years 1 months ago
2009
ACM
This paper introduces LDA-G, a scalable Bayesian approach to finding latent group structures in large real-world graph data. Existing Bayesian approaches for group discovery (suc...
171
click to vote
ML
2010
ACM
15 years 5 months ago
2010
ACM
In several domains it is common to have data from different, but closely related problems. For instance, in manufacturing, many products follow the same industrial process but with...
186
click to vote
ICDE
2009
IEEE
16 years 1 months ago
2009
IEEE
— Information extraction (IE) systems are trained to extract specific relations from text databases. Real-world applications often require that the output of multiple IE systems...
199
click to vote
ICDE
1992
IEEE
15 years 10 months ago
1992
IEEE
Contrary to popular belief, relation schemes in good classical normal forms are not necessarily devoid of redundancies. This arises from the fact that classical data dependencies ...