Sciweavers

591 search results - page 9 / 119
» Implementing Joins Using Extensible Pattern Matching
Sort
View
AOSD
2004
ACM
14 years 24 days ago
Virtual machine support for dynamic join points
A widespread implementation approach for the join point mechanism of aspect-oriented languages is to instrument areas in code that match the static part of pointcut designators, i...
Christoph Bockisch, Michael Haupt, Mira Mezini, Kl...
CIKM
2005
Springer
14 years 28 days ago
Exact match search in sequence data using suffix trees
We study suitable indexing techniques to support efficient exact match search in large biological sequence databases. We propose a suffix tree (ST) representation, called STA-DF, ...
Mihail Halachev, Nematollaah Shiri, Anand Thamildu...
SSDBM
2003
IEEE
164views Database» more  SSDBM 2003»
14 years 19 days ago
Approximate String Joins
String data is ubiquitous, and its management has taken on particular importance in the past few years. Approximate queries are very important on string data especially for more c...
Divesh Srivastava
NSDI
2010
13 years 8 months ago
The Architecture and Implementation of an Extensible Web Crawler
Many Web services operate their own Web crawlers to discover data of interest, despite the fact that largescale, timely crawling is complex, operationally intensive, and expensive...
Jonathan M. Hsieh, Steven D. Gribble, Henry M. Lev...
IJSWIS
2008
135views more  IJSWIS 2008»
13 years 7 months ago
Efficient Processing of RDF Queries with Nested Optional Graph Patterns in an RDBMS
Relational technology has shown to be very useful for scalable Semantic Web data management. Numerous researchers have proposed to use RDBMSs to store and query voluminous RDF dat...
Artem Chebotko, Shiyong Lu, Mustafa Atay, Farshad ...