Sciweavers

559 search results - page 69 / 112
» Indexing Weighted-Sequences in Large Databases
Sort
View
DSMML
2004
Springer
14 years 2 months ago
Redundant Bit Vectors for Quickly Searching High-Dimensional Regions
Applications such as audio fingerprinting require search in high dimensions: find an item in a database that is similar to a query. An important property of this search task is t...
Jonathan Goldstein, John C. Platt, Christopher J. ...
SSDBM
2007
IEEE
172views Database» more  SSDBM 2007»
14 years 3 months ago
Enabling Real-Time Querying of Live and Historical Stream Data
Applications that query data streams in order to identify trends, patterns, or anomalies can often benefit from comparing the live stream data with archived historical stream dat...
Frederick Reiss, Kurt Stockinger, Kesheng Wu, Arie...
DEXA
2006
Springer
139views Database» more  DEXA 2006»
14 years 20 days ago
Distributed Continuous Range Query Processing on Moving Objects
Recent work on continuous queries has focused on processing queries in very large, mobile environments. In this paper, we propose a system leveraging the computing capacities of mo...
Haojun Wang, Roger Zimmermann, Wei-Shinn Ku
DEXA
2008
Springer
117views Database» more  DEXA 2008»
13 years 10 months ago
Space-Partitioning-Based Bulk-Loading for the NSP-Tree in Non-ordered Discrete Data Spaces
Properly-designed bulk-loading techniques are more efficient than the conventional tuple-loading method in constructing a multidimensional index tree for a large data set. Although...
Gang Qian, Hyun-Jeong Seok, Qiang Zhu, Sakti Prama...
DEXA
2010
Springer
213views Database» more  DEXA 2010»
13 years 10 months ago
Efficient K-Nearest Neighbor Search in Time-Dependent Spatial Networks
The class of k Nearest Neighbor (kNN) queries in spatial networks has been widely studied in the literature. All existing approaches for kNN search in spatial networks assume that ...
Ugur Demiryurek, Farnoush Banaei Kashani, Cyrus Sh...