Sciweavers

1042 search results - page 59 / 209
» Constraint Databases, Data Structures and Efficient Query Ev...
Sort
View
NIPS
1990
13 years 9 months ago
Bumptrees for Efficient Function, Constraint and Classification Learning
A new class of data structures called "bumptrees" is described. These structures are useful for efficiently implementing a number of neural network related operations. A...
Stephen M. Omohundro
ICDE
2008
IEEE
118views Database» more  ICDE 2008»
14 years 9 months ago
Robust Runtime Optimization of Data Transfer in Queries over Web Services
Self-managing solutions have recently attracted a lot of interest from the database community. The need for self-* properties is more evident in distributed applications comprising...
Anastasios Gounaris, Christos Yfoulis, Rizos Sakel...
TIME
1997
IEEE
13 years 12 months ago
On Effective Data Clustering in Bitemporal Databases
Temporal databases provide built-in supports for efficient recording and querying of time-evolving data. In this paper, data clustering issues in temporal database environment are...
Jong Soo Kim, Myoung-Ho Kim
CIKM
2010
Springer
13 years 5 months ago
EntityEngine: answering entity-relationship queries using shallow semantics
We introduce EntityEngine, a system for answering entityrelationship queries over text. Such queries combine SQLlike structures with IR-style keyword constraints and therefore, ca...
Xiaonan Li, Chengkai Li, Cong Yu
DKE
1998
88views more  DKE 1998»
13 years 7 months ago
Temporal Grid File: A File Structure for Interval Data
Disk I/O is a major bottleneck for query processing in database applications. This bottleneck is especially a problem for temporal databases because of their large size. Reduction...
Chiang Lee, Te-Ming Tseng