521 search results - page 86 / 105 » Efficiently publishing relational data as XML documents |
166
click to vote
POPL
2006
ACM
15 years 10 months ago
2006
ACM
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...
BMCBI
2008
14 years 9 months ago
2008
Background: The current versions of the COG and arCOG databases, both excellent frameworks for studies in comparative and functional genomics, do not contain the nucleotide sequen...
VLDB
2001
ACM
15 years 2 months ago
2001
ACM
Queries navigate semistructured data via path expressions, and can be accelerated using an index. Our solution encodes paths as strings, and inserts those strings into a special i...
SIGMOD
2010
ACM
14 years 7 months ago
2010
ACM
Given the continuous growth of databases and the abundance of diverse files in modern IT environments, there is a pressing need to integrate keyword search on heterogeneous inform...
129
click to vote
SDM
2008
SIAM
14 years 11 months ago
2008
SIAM
Graph data such as chemical compounds and XML documents are getting more common in many application domains. A main difficulty of graph data processing lies in the intrinsic high ...