Sciweavers

1004 search results - page 19 / 201
» Safe Constraint Queries
Sort
View
DATESO
2007
103views Database» more  DATESO 2007»
13 years 9 months ago
Using BMH Algorithm to Solve Subset of XPath Queries
Boyer-Moore-Horspool (BMH) algorithm is commonly used to solve text searching problems. In this paper is used to solve the constraint subset of XPath queries offering effective alg...
David Toth
DOLAP
2003
ACM
14 years 24 days ago
Exploiting hierarchical clustering in evaluating multidimensional aggregation queries
Multidimensional aggregation queries constitute the single most important class of queries for data warehousing applications and decision support systems. The bottleneck in the ev...
Dimitri Theodoratos
QSIC
2005
IEEE
14 years 1 months ago
Proving the Safety of SQL Queries
Many programs need to access data in a relational database. This is usually done by means of queries written in SQL. Although the language SQL is declarative, certain runtime erro...
Stefan Brass, Christian Goldberg
IDEAS
2005
IEEE
109views Database» more  IDEAS 2005»
14 years 1 months ago
Efficient Relational Joins with Arithmetic Constraints on Multiple Attributes
We introduce and study a new class of queries that we refer to as ACMA (arithmetic constraints on multiple attributes) queries. Such combinatorial queries require the simultaneous...
Chuang Liu, Lingyun Yang, Ian T. Foster
ADBIS
2001
Springer
115views Database» more  ADBIS 2001»
14 years 1 days ago
Interactive Constraint-Based Sequential Pattern Mining
Data mining is an interactive and iterative process. It is very likely that a user will execute a series of similar queries differing in pattern constraints and mining parameters,...
Marek Wojciechowski