Sciweavers

2608 search results - page 98 / 522
» Inferring Answers to Queries
Sort
View
MFCS
2009
Springer
16 years 13 days ago
Query Automata for Nested Words
We study visibly pushdown automata (VPA) models for expressing and evaluating queries, expressed using MSO formulas, on words with a nesting structure (like XML documents). We deļ...
P. Madhusudan, Mahesh Viswanathan
155
Voted
CAISE
2006
Springer
15 years 9 months ago
A Non-Linear Cost Model for Multi-Node OLAP Systems
Answering performance to business queries, mainly of aggregated nature, known as On-Line Analytical Processing queries, depends heavily on the proper selection of multidimensional ...
Jorge Loureiro, Orlando Belo
ICDE
2004
IEEE
148views Database» more  ICDE 2004»
16 years 7 months ago
Approximate Selection Queries over Imprecise Data
We examine the problem of evaluating selection queries over imprecisely represented objects. Such objects are used either because they are much smaller in size than the precise on...
Iosif Lazaridis, Sharad Mehrotra
DOLAP
2005
ACM
15 years 7 months ago
A personalization framework for OLAP queries
OLAP users heavily rely on visualization of query answers for their interactive analysis of massive amounts of data. Very often, these answers cannot be visualized entirely and th...
Ladjel Bellatreche, Arnaud Giacometti, Patrick Mar...
155
Voted
IS
2008
15 years 5 months ago
The complexity and approximation of fixing numerical attributes in databases under integrity constraints
Consistent query answering is the problem of characterizing and computing the semantically correct answers to queries from a database that may not satisfy certain integrity constr...
Leopoldo E. Bertossi, Loreto Bravo, Enrico Francon...