1482 search results - page 259 / 297 » An Algebra for XML Query |
CIDR
2009
13 years 10 months ago
2009
Recent work has shown that we can dramatically improve the performance of computer games and simulations through declarative processing: Character AI can be written in an imperati...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
A purely relational account of the true XQuery semantics can turn any relational database system into an XQuery processor. Compiling nested expressions of the fully compositional X...
WWW
2007
ACM
14 years 10 months ago
2007
ACM
Extractors and taggers turn unstructured text into entityrelation (ER) graphs where nodes are entities (email, paper, person, conference, company) and edges are relations (wrote, ...
EDBT
2010
ACM
14 years 4 months ago
2010
ACM
Schemas, and more generally metadata specifying structural and semantic constraints, are invaluable in data management. They facilitate conceptual design and enable checking of da...
DASFAA
2005
IEEE
14 years 2 months ago
2005
IEEE
The fundamental drawback of unstructured peer-to-peer (P2P) networks is the flooding-based query processing protocol that seriously limits their scalability. As a result, a signiï...