Sciweavers

3652 search results - page 206 / 731
» A study of query length
Sort
View
LPAR
2007
Springer
14 years 2 months ago
Data Complexity in the EL Family of Description Logics
We study the data complexity of instance checking and conjunctive query answering in the EL family of description logics, with a particular emphasis on the boundary of tractability...
Adila Krisnadhi, Carsten Lutz
VLDB
1989
ACM
104views Database» more  VLDB 1989»
14 years 8 days ago
Gral: An Extensible Relational Database System for Geometric Applications
: We describe the architecture of a relational databasesystem that is extensible by user-defined data types and operations, including relation operations. The central concept is to...
Ralf Hartmut Güting
PVLDB
2008
148views more  PVLDB 2008»
13 years 7 months ago
StreamTX: extracting tuples from streaming XML data
We study the problem of extracting flattened tuple data from streaming, hierarchical XML data. Tuple-extraction queries are essentially XML pattern queries with multiple extractio...
Wook-Shin Han, Haifeng Jiang, Howard Ho, Quanzhong...
SIGMOD
2008
ACM
193views Database» more  SIGMOD 2008»
14 years 8 months ago
ARCube: supporting ranking aggregate queries in partially materialized data cubes
Supporting ranking queries in database systems has been a popular research topic recently. However, there is a lack of study on supporting ranking queries in data warehouses where...
Tianyi Wu, Dong Xin, Jiawei Han
VLDB
2007
ACM
124views Database» more  VLDB 2007»
14 years 2 months ago
Ad-hoc Top-k Query Answering for Data Streams
A top-k query retrieves the k highest scoring tuples from a data set with respect to a scoring function defined on the attributes of a tuple. The efficient evaluation of top-k q...
Gautam Das, Dimitrios Gunopulos, Nick Koudas, Niko...