Sciweavers

400 search results - page 63 / 80
» XML data exchange: consistency and query answering
Sort
View
STOC
2002
ACM
119views Algorithms» more  STOC 2002»
14 years 8 months ago
Space-efficient approximate Voronoi diagrams
Given a set S of n points in IRd , a (t, )-approximate Voronoi diagram (AVD) is a partition of space into constant complexity cells, where each cell c is associated with t represe...
Sunil Arya, Theocharis Malamatos, David M. Mount
WWW
2002
ACM
14 years 8 months ago
RQL: a declarative query language for RDF
Real-scale Semantic Web applications, such as Knowledge Portals and E-Marketplaces, require the managementof large volumes of metadata, i.e., information describing the available ...
Gregory Karvounarakis, Sofia Alexaki, Vassilis Chr...
AMSTERDAM
2009
13 years 5 months ago
The Data Complexity of the Syllogistic Fragments of English
Abstract. Pratt and Third's syllogistic fragments of English can be used to capture, in addition to syllogistic reasoning, many other kinds of common sense reasoning, and, in ...
Camilo Thorne, Diego Calvanese
RTA
2010
Springer
13 years 11 months ago
Automata for Data Words and Data Trees
Data words and data trees appear in verification and XML processing. The term “data” means that positions of the word, or tree, are decorated with elements of an infinite set...
Mikolaj Bojanczyk
CINQ
2004
Springer
189views Database» more  CINQ 2004»
14 years 1 months ago
Employing Inductive Databases in Concrete Applications
In this paper we present the application of the inductive database approach to two practical analytical case studies: Web usage mining in Web logs and financial data. As far as co...
Rosa Meo, Pier Luca Lanzi, Maristella Matera, Dani...