185 search results - page 5 / 37 » Precise complexity analysis for efficient datalog queries |
156
click to vote
SIGMOD
2008
ACM
15 years 9 months ago
2008
ACM
Pattern matching over event streams is increasingly being employed in many areas including financial services, RFIDbased inventory management, click stream analysis, and electroni...
84
Voted
ICASSP
2008
IEEE
15 years 3 months ago
2008
IEEE
There has been much recent progress in the technical infrastructure necessary to continuously characterize and archive all sounds, or more precisely auditory streams, that occur w...
87
Voted
VLDB
2002
ACM
14 years 9 months ago
2002
ACM
Our experimental analysis of several popular XPath processors reveals a striking fact: Query evaluation in each of the systems requires time exponential in the size of queries in ...
STOC
2005
ACM
15 years 9 months ago
2005
ACM
We construct an efficient probabilistic algorithm that, given a finite set with a binary operation, tests if it is an abelian group. The distance used is an analogue of the edit d...
FOCS
1998
IEEE
15 years 1 months ago
1998
IEEE
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...