Sciweavers

356 search results - page 34 / 72
» Knowledge Representation using Schema Tuple Queries
Sort
View
86
Voted
ICCS
2007
Springer
15 years 1 months ago
A Comparison of Different Conceptual Structures Projection Algorithms
Knowledge representation (KR) is used to store and retrieve meaningful data. This data is saved using dynamic data structures that are suitable for the style of KR being implemente...
Heather D. Pfeiffer, Roger T. Hartley
72
Voted
EDBT
2009
ACM
113views Database» more  EDBT 2009»
15 years 4 months ago
Supporting annotations on relations
Annotations play a key role in understanding and curating databases. Annotations may represent comments, descriptions, lineage information, among several others. Annotation manage...
Mohamed Y. Eltabakh, Walid G. Aref, Ahmed K. Elmag...
98
Voted
APIN
2002
106views more  APIN 2002»
14 years 9 months ago
Querying Temporal Constraint Networks: A Unifying Approach
We develop the scheme of indefinite constraint databases using first-order logic as our representation language. When this scheme is instantiated with temporal constraints, the res...
Manolis Koubarakis
66
Voted
EDBT
2010
ACM
188views Database» more  EDBT 2010»
15 years 4 months ago
Subsumption and complementation as data fusion operators
The goal of data fusion is to combine several representations of one real world object into a single, consistent representation, e.g., in data integration. A very popular operator...
Jens Bleiholder, Sascha Szott, Melanie Herschel, F...
FODO
1998
Springer
214views Algorithms» more  FODO 1998»
15 years 1 months ago
Querying Composite Objects in Semistructured Data
In this paper, we propose an entity-based style of queries for semistructured data. First, we partition a semistructured data into subgraphs corresponding to real-world entities, ...
Keishi Tajima