294 search results - page 6 / 59 » Efficiently Processing Queries on Interval-and-Value Tuples ... |
DKE
2006
14 years 9 months ago
2006
Recursive queries are quite important in the context of XML databases. In addition, several recent papers have investigated a relational approach to store XML data and there is gr...
SEKE
2007
Springer
15 years 3 months ago
2007
Springer
In this paper, we present an approach to query processing for paraconsistent databases in the presence of integrity constraints. Paraconsistent databases are capable of representi...
113
click to vote
EDBT
1992
ACM
15 years 29 days ago
1992
ACM
The DBGraph storage model, designed for main memory DBMS, ensures both data storage compactness and efficient processing for all database operations. By representing the entire da...
DATESO
2009
14 years 7 months ago
2009
Indexing methods for efficient processing of multidimensional data are very requested in many fields, like geographical information systems, drawing documentations etc. Well-known ...
190
click to vote
ICDE
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract-- When dealing with massive quantities of data, topk queries are a powerful technique for returning only the k most relevant tuples for inspection, based on a scoring func...