Results 1  10
of
188,774
Compact Representation for Answer Sets of nary Regular Queries
"... Abstract. An nary query over trees takes an input tree t and returns a set of ntuples of the nodes of t. In this paper, a compact data structure is introduced for representing the answer sets of nary queries defined by tree automata. Despite that the number of the elements of the answer set can b ..."
Abstract
 Add to MetaCart
Abstract. An nary query over trees takes an input tree t and returns a set of ntuples of the nodes of t. In this paper, a compact data structure is introduced for representing the answer sets of nary queries defined by tree automata. Despite that the number of the elements of the answer set can
Regular nary queries in trees and variable independence
 in: International Conference on Theoretical Computer Science (IFIP TCS), 2008
"... Summary. Regular nary queries in trees are queries which are definable by an MSO formula with n free firstorder variables. We investigate the variable independence problem – originally introduced for databases – in the context of trees. In particular, we show how to decide whether a regular query ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Summary. Regular nary queries in trees are queries which are definable by an MSO formula with n free firstorder variables. We investigate the variable independence problem – originally introduced for databases – in the context of trees. In particular, we show how to decide whether a regular query
Efficient Evaluation of nary Conjunctive Queries over Trees and Graphs
 In Proc. ACM Int’l. Workshop on Web Information and Data Management (WIDM
, 2006
"... Nary conjunctive queries, i.e., queries with any number of answer variables, are the formal core of many Web query languages including XSLT, XQuery, SPARQL, and Xcerpt. Despite a considerable body of research on the optimization of such queries over treeshaped XML data, little attention has been p ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
Nary conjunctive queries, i.e., queries with any number of answer variables, are the formal core of many Web query languages including XSLT, XQuery, SPARQL, and Xcerpt. Despite a considerable body of research on the optimization of such queries over treeshaped XML data, little attention has been
Querying Regular Sets of XML Documents
 in "International Workshop on Logic in Databases (LiD), Italie
, 2008
"... Abstract. We investigate the problem of querying (regular) sets of XML documents represented with tree automata and we consider nary tree automata queries whose expressive power captures MSO on trees. Because finite automata can represent infinite sets of documents, we propose the notions of unive ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. We investigate the problem of querying (regular) sets of XML documents represented with tree automata and we consider nary tree automata queries whose expressive power captures MSO on trees. Because finite automata can represent infinite sets of documents, we propose the notions
Finite Representation of Infinite Query Answers
, 1992
"... : We define here a formal notion of finite representation of infinite query answers in logic programs. We apply this notion to Datalog nS (Datalog with n successors): an extension of Datalog capable of representing infinite phenomena like flow of time or plan construction. Predicates in Datalog nS ..."
Abstract

Cited by 34 (5 self)
 Add to MetaCart
S can have arbitrary unary and limited nary function symbols in one fixed position. This class of logic programs is known to be decidable. However, least Herbrand models of Datalog nS programs may be infinite and consequently queries may have infinite answers. We present a method to finitely represent
Learning nary node selecting tree transducers from completely annotated examples
 in &quot;International Colloquium on Grammatical Inference&quot;, Lecture Notes in Artificial Intelligence
, 2006
"... Abstract. We present the first algorithm for learning nary node selection queries in trees from completely annotated examples by methods of grammatical inference. We propose to represent nary queries by deterministic nary node selecting tree transducers (nNSTTs). These are tree automata that cap ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
Abstract. We present the first algorithm for learning nary node selection queries in trees from completely annotated examples by methods of grammatical inference. We propose to represent nary queries by deterministic nary node selecting tree transducers (nNSTTs). These are tree automata
Network Centric Warfare: Developing and Leveraging Information Superiority
 Command and Control Research Program (CCRP), US DoD
, 2000
"... the mission of improving DoD’s understanding of the national security implications of the Information Age. Focusing upon improving both the state of the art and the state of the practice of command and control, the CCRP helps DoD take full advantage of the opportunities afforded by emerging technolo ..."
Abstract

Cited by 308 (5 self)
 Add to MetaCart
aspect of the CCRP program is its ability to serve as a bridge between the operational, technical, analytical, and educational communities. The CCRP provides leadership for the command and control research community by: n n
Closed Patterns Meet nary Relations
, 2009
"... Set pattern discovery from binary relations has been extensively studied during the last decade. In particular, many complete and efficient algorithms for frequent closed set mining are now available. Generalizing such a task to nary relations (n ≥ 2) appears as a timely challenge. It may be import ..."
Abstract

Cited by 23 (11 self)
 Add to MetaCart
Set pattern discovery from binary relations has been extensively studied during the last decade. In particular, many complete and efficient algorithms for frequent closed set mining are now available. Generalizing such a task to nary relations (n ≥ 2) appears as a timely challenge. It may
Succinct indexable dictionaries with applications to encoding kary trees and multisets
 In Proceedings of the 13th Annual ACMSIAM Symposium on Discrete Algorithms (SODA
"... We consider the indexable dictionary problem, which consists of storing a set S ⊆ {0,...,m − 1} for some integer m, while supporting the operations of rank(x), which returns the number of elements in S that are less than x if x ∈ S, and −1 otherwise; and select(i) which returns the ith smallest ele ..."
Abstract

Cited by 257 (15 self)
 Add to MetaCart
structure, including: • an informationtheoretically optimal representation of a kary cardinal tree that supports standard operations in constant time, • a representation of a multiset of size n from {0,...,m − 1} in B(n,m+n) + o(n) bits that supports (appropriate generalizations of) rank and select
Results 1  10
of
188,774