Sciweavers

415 search results - page 33 / 83
» Efficient Processing of Relational Queries with Sum Constrai...
Sort
View
CIKM
2010
Springer
13 years 7 months ago
Automatic schema merging using mapping constraints among incomplete sources
Schema merging is the process of consolidating multiple schemas into a unified view. The task becomes particularly challenging when the schemas are highly heterogeneous and autono...
Xiang Li 0002, Christoph Quix, David Kensche, Sand...
VLDB
1994
ACM
99views Database» more  VLDB 1994»
14 years 1 months ago
Join Index Hierarchies for Supporting Efficient Navigations in Object-Oriented Databases
A join index hierarchy method is proposed to handle the "goto's on disk" problem in objectoriented query processing. The method constructs a hierarchy of join indic...
Zhaohui Xie, Jiawei Han
RIAO
2007
13 years 11 months ago
A Robust Linguistic Platform for Efficient and Domain specific Web Content Analysis
Web semantic access in specific domains calls for specialized search engines with enhanced semantic querying and indexing capacities, which pertain both to information retrieval (...
Thierry Hamon, Adeline Nazarenko, Thierry Poibeau,...
DASFAA
2004
IEEE
158views Database» more  DASFAA 2004»
14 years 1 months ago
A Cost Model for Spatial Intersection Queries on RI-Trees
Abstract. The efficient management of interval sequences represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tr...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...
SSDBM
2002
IEEE
149views Database» more  SSDBM 2002»
14 years 2 months ago
A Cost Model for Interval Intersection Queries on RI-Trees
The efficient management of interval data represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tree1 ), an effi...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...