Results 1  10
of
117
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
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 35 (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
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 259 (16 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
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 2 (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
Approximate Computation of Multidimensional Aggregates of Sparse Data Using Wavelets
"... Computing multidimensional aggregates in high dimensions is a performance bottleneck for many OLAP applications. Obtaining the exact answer to an aggregation query can be prohibitively expensive in terms of time and/or storage space in a data warehouse environment. It is advantageous to have fast, a ..."
Abstract

Cited by 198 (3 self)
 Add to MetaCart
, approximate answers to OLAP aggregation queries. In this paper, we present anovel method that provides approximate answers to highdimensional OLAP aggregation queries in massive sparse data sets in a timeefficient and spaceefficient manner. We construct a compact data cube, which is an approximate
Query Evaluation with Constant Delay
"... I am grateful to Luc Segoufin who kindly accepted me to be his PhD student. He introduced me to the problem of query enumeration and encouraged me to look for the answers to all the questions that emerged during our collaboration. He was a truly great advisor, always supportive and available for dis ..."
Abstract
 Add to MetaCart
I am grateful to Luc Segoufin who kindly accepted me to be his PhD student. He introduced me to the problem of query enumeration and encouraged me to look for the answers to all the questions that emerged during our collaboration. He was a truly great advisor, always supportive and available
Compact aspect embedding for diversified query expansions
 In Proc. of AAAI’14
, 2014
"... Diversified query expansion (DQE) based approaches aim to select a set of expansion terms with less redundancy among them while covering as many query aspects as possible. Recently they have experimentally demonstrate their effectiveness for the task of search result diversification. One challeng ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
lenge faced by existing DQE approaches is to ensure the aspect coverage. In this paper, we propose a novel method for DQE, called compact aspect embedding, which exploits trace norm regularization to learn a low rank vector space for the query, with each eigenvector of the learnt vector space repre
Query Automata for Nested Words
"... We study visibly pushdown automata (VPA) models for expressing and evaluating queries, expressed using MSO formulas, on words with a nesting structure (like XML documents). We define a query VPA model, which is a 2way deterministic VPA that can mark positions in a document, and show that it is equi ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
. This algorithm uses space close to the minimal space any streaming algorithm would need, and generalizes to answering nary queries. 1
A new method to index and query sets
 In: Proc. 16th Int. Conf. on Artificial Intelligence (IJCAI’99
, 1999
"... Let us consider the following problem: Given a (probably huge) set of sets S and a query set g, is there some set s S such that This problem occurs in at least four application areas: the matching of a large number (usually several 100,000s) of production rules, the processing of queries in data bas ..."
Abstract

Cited by 14 (2 self)
 Add to MetaCart
representation of such a huge set of sets and an efficient answering of subset and superset queries. The algorithm has been used successfully in the IPP system and enabled this planner to win the ADL track of the first planning competition. 1
An Efficient Interactive Algorithm for Regular Language Learning
 COMPUTER SCIENCE TR9502, IOWA STATE UNIVERSITY
, 1995
"... This paper presents an efficient algorithm for learning regular grammars. A knowledgeable teacher provides the learner with a structurally complete set of strings that belong to L(G), the language corresponding to an unknown regular grammar G. This structurally complete set of positive examples ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
space. The learner maintains at all time, a compact representation of the lattice in the form of two sets S and G that correspond (respectively) to the set of most specific and most general grammars consistent with the set of positive examples provided and the queries answered by the teacher up
Results 1  10
of
117