1042 search results - page 59 / 209 » Constraint Databases, Data Structures and Efficient Query Ev... |
131
click to vote
NIPS
1990
15 years 3 months ago
1990
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...
215
click to vote
ICDE
2008
IEEE
16 years 3 months ago
2008
IEEE
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...
102
click to vote
TIME
1997
IEEE
15 years 6 months ago
1997
IEEE
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...
128
Voted
CIKM
2010
Springer
14 years 12 months ago
2010
Springer
We introduce EntityEngine, a system for answering entityrelationship queries over text. Such queries combine SQLlike structures with IR-style keyword constraints and therefore, ca...
116
click to vote
DKE
1998
15 years 1 months ago
1998
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...