Searching for authors named "Floris Geerts" – sorted by Relevance.
25 documents found, showing 1 through 10.
Next 10 →
-
On-line topological simplification of
- …weighted graphs…
- Add To MetaCart
-
On-line maintenance of simplified weighted graphs for efficient distance queries
- …We give two efficient on-line algorithms to simplify weighted graphs by eliminating degree-two vertices. Our algorithms are on-line — they react to updates on the data, keeping the simplification up-to-date. We provide both analytical and empirical evaluations of the efficiency of our algorithms. We…
- Cited by 1 (1 self) – Add To MetaCart
-
Moving objects and their equations of motion
- …Abstract. Moving objects are currently represented in databases by means of an explicit representation of their trajectory. However from a physical point of view, or more specifically according to Newton’s second law of motion, a moving object is fully described by its equation of motion. We introdu…
- Cited by 1 (0 self) – Add To MetaCart
-
unknown title
- …www.elsevier.com/locate/tcs On the decidability of termination of query evaluation in transitive-closure logics for polynomial constraint databases �…
- Add To MetaCart
-
Issues in Biological Databases (DBiBD) that was held during
- …e-Science Centre in Edinburgh, United Kingdom. It is the result of a joint effort of the National e-Science Centre, the European Bioinformatics Institute and the Edinburgh Database Group. This workshop brings together biologists who are consumers of database technology and database researchers who a…
- Add To MetaCart
-
Expressing topological connectivity of spatial databases
- …Abstract. We consider two-dimensional spatial databases defined in terms of polynomial inequalities and focus on the potential of programming languages for such databases to express queries related to topological connectivity. It is known that the topological connectivity test is not first-order exp…
- Cited by 8 (3 self) – Add To MetaCart
-
Deciding termination of query evaluation in transitive-closure logics for constraint databases
- …The formalism of constraint databases, in which possibly infinite data sets are described by Boolean combinations of polynomial inequality and equality constraints, has its main application area in spatial databases. The standard query language for polynomial constraint databases is first-order logi…
- Cited by 4 (2 self) – Add To MetaCart
-
Satisfiability of XPath queries with sibling axes
- …Abstract. We study the satisfiability problem for XPath fragments supporting the following-sibling and preceding-sibling axes. Although this problem was recently studied for XPath fragments without sibling axes, little is known about the impact of the sibling axes on the satisfiability analysis. To …
- Cited by 10 (0 self) – Add To MetaCart
-
T.: What you store is what you get (extended abstract
- …Abstract. Recent studies emerged the need for representations of frequent itemsets that allow to estimate supports. Several methods have been proposed that achieve this goal by generating only a subset of all frequent itemsets. In this paper, we propose another approach, that given a minimum support…
- Cited by 2 (0 self) – Add To MetaCart
Showing 1 through 10.
Next 10 →
