Sciweavers

813 search results - page 25 / 163
» Languages for Relational Databases over Interpreted Structur...
Sort
View
APLAS
2007
ACM
14 years 12 days ago
Finally Tagless, Partially Evaluated
We have built the first family of tagless interpretations for a higher-order typed object language in a typed metalanguage (Haskell or ML) that require no dependent types, general...
Jacques Carette, Oleg Kiselyov, Chung-chieh Shan
ICDE
2005
IEEE
134views Database» more  ICDE 2005»
14 years 2 months ago
Index Structures for Matching XML Twigs Using Relational Query Processors
Various index structures have been proposed to speed up the evaluation of XML path expressions. However, existing XML path indices suffer from at least one of three limitations: ...
Zhiyuan Chen, Johannes Gehrke, Flip Korn, Nick Kou...
EMNLP
2011
12 years 8 months ago
Structured Relation Discovery using Generative Models
We explore unsupervised approaches to relation extraction between two named entities; for instance, the semantic bornIn relation between a person and location entity. Concretely, ...
Limin Yao, Aria Haghighi, Sebastian Riedel, Andrew...
JANCL
2002
90views more  JANCL 2002»
13 years 8 months ago
A Topological Constraint Language with Component Counting
A topological constraint language is a formal language whose variables range over certain subsets of topological spaces, and whose nonlogical primitives are interpreted as topologi...
Ian Pratt-Hartmann
ICDT
2009
ACM
108views Database» more  ICDT 2009»
14 years 9 months ago
A compositional query algebra for second-order logic and uncertain databases
World-set algebra is a variable-free query language for uncertain databases. It constitutes the core of the query language implemented in MayBMS, an uncertain database system. Thi...
Christoph Koch