Sciweavers

528 search results - page 64 / 106
» The Similarity Join Database Operator
Sort
View
BIOINFORMATICS
2011
14 years 1 months ago
RINQ: Reference-based Indexing for Network Queries
We consider the problem of similarity queries in biological network databases. Given a database of networks, similarity query returns all the database networks whose similarity (i...
Günhan Gülsoy, Tamer Kahveci
ICCS
2007
Springer
15 years 3 months ago
Searching and Updating Metric Space Databases Using the Parallel EGNAT
Abstract. The Evolutionary Geometric Near-neighbor Access Tree (EGNAT) is a recently proposed data structure that is suitable for indexing large collections of complex objects. It ...
Mauricio Marín, Roberto Uribe, Ricardo J. B...

Publication
309views
16 years 9 months ago
SOLE: Scalable On-Line Execution of Continuous Queries on Spatio-temporal Data Streams
This paper presents the Scalable On-Line Execution algorithm (SOLE, for short) for continuous and on-line evaluation of concurrent continuous spatio- temporal queries over data str...
Mohamed F. Mokbel, Walid G. Aref
SIGMOD
2009
ACM
137views Database» more  SIGMOD 2009»
15 years 10 months ago
Enabling enterprise mashups over unstructured text feeds with InfoSphere MashupHub and SystemT
Enterprise mashup scenarios often involve feeds derived from data created primarily for eye consumption, such as email, news, calendars, blogs, and web feeds. These data sources c...
David E. Simmen, Frederick Reiss, Yunyao Li, Sures...
IDEAS
2000
IEEE
96views Database» more  IDEAS 2000»
15 years 2 months ago
A Cost Function for Uniformly Partitioned UB-Trees
Most operations of the relational algebra or SQL - like projection with duplicate elimination, join, ordering, group by and aggregations - are efficiently processed using a sorted...
Volker Markl, Rudolf Bayer