Sciweavers

294 search results - page 18 / 59
» Efficiently Processing Queries on Interval-and-Value Tuples ...
Sort
View
94
Voted
ADBIS
2003
Springer
204views Database» more  ADBIS 2003»
15 years 1 months ago
Hierarchical Bitmap Index: An Efficient and Scalable Indexing Technique for Set-Valued Attributes
Abstract. Set-valued attributes are convenient to model complex objects occurring in the real world. Currently available database systems support the storage of set-valued attribut...
Mikolaj Morzy, Tadeusz Morzy, Alexandros Nanopoulo...
AAAI
1990
14 years 10 months ago
The Intelligent Database Interface: Integrating AI and Database Systems
The Intelligent Database Interface (IDI) is a cache-based interface that is designed to provide Artificial Intelligence systems with efficient access to one or more databases on o...
Donald P. McKay, Timothy W. Finin, Anthony B. O'Ha...
DKE
1998
88views more  DKE 1998»
14 years 9 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
ICDT
2009
ACM
166views Database» more  ICDT 2009»
15 years 10 months ago
A compositional framework for complex queries over uncertain data
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...
Christoph Koch, Michaela Götz
78
Voted
IDEAS
2000
IEEE
96views Database» more  IDEAS 2000»
15 years 1 months ago
A Cost Function for Uniformly Partitioned UB-Trees
Most operations of the relational algebra or SQL - like projection with duplicate elimination, join, ordering, group by and aggregations - are efficiently processed using a sorted...
Volker Markl, Rudolf Bayer