Sciweavers

3814 search results - page 544 / 763
» Extensible Information Brokers
Sort
View
RTA
1995
Springer
15 years 10 months ago
Completion for Multiple Reduction Orderings
We present a completion procedure (called MKB) that works for multiple reduction orderings. Given equations and a set of reduction orderings, the procedure simulates a computation ...
Masahito Kurihara, Hisashi Kondo, Azuma Ohuchi
SIGMOD
1995
ACM
80views Database» more  SIGMOD 1995»
15 years 10 months ago
Join Queries with External Text Sources: Execution and Optimization Techniques
Text is a pervasive information type, and many applications require querying over text sources in addition to structured data. This paper studies the problem of query processing i...
Surajit Chaudhuri, Umeshwar Dayal, Tak W. Yan
POPL
1990
ACM
15 years 10 months ago
Concurrent Constraint Programming
Abstract. Concurrent constraint programming is a simple but powerful framework for computation based on four basic computational ideas: concurrency (multiple agents are simultaneou...
Vijay A. Saraswat, Martin C. Rinard
APSEC
2009
IEEE
15 years 10 months ago
Sequence Diagram Slicing
Software visualization with sequence diagrams is one of the promising techniques aimed at helping developers comprehend the behavior of object-oriented systems effectively. However...
Kunihiro Noda, Takashi Kobayashi, Kiyoshi Agusa, S...
EDBT
2010
ACM
155views Database» more  EDBT 2010»
15 years 10 months ago
Suffix tree construction algorithms on modern hardware
Suffix trees are indexing structures that enhance the performance of numerous string processing algorithms. In this paper, we propose cache-conscious suffix tree construction algo...
Dimitris Tsirogiannis, Nick Koudas