Sciweavers

1679 search results - page 133 / 336
» Pointcuts as Functional Queries
Sort
View
COCOON
1998
Springer
15 years 9 months ago
The Colored Sector Search Tree: A Dynamic Data Structure for Efficient High Dimensional Nearest-Foreign-Neighbor Queries
Abstract. In this paper we present the new data structure Colored Sector Search Tree (CSST ) for solving the Nearest-Foreign-Neighbor Query Problem (NFNQP ): Given a set S of n col...
Thomas Graf, V. Kamakoti, N. S. Janaki Latha, C. P...
ER
2006
Springer
158views Database» more  ER 2006»
15 years 8 months ago
Database to Semantic Web Mapping Using RDF Query Languages
One of the main drawbacks of the Semantic Web is the lack of semantically rich data, since most of the information is still stored in relational databases. In this paper, we presen...
Cristian Pérez de Laborda, Stefan Conrad
EUROCRYPT
2010
Springer
15 years 8 months ago
Stam's Collision Resistance Conjecture
At CRYPTO 2008 Stam [7] made the following conjecture: if an m + s-bit to s-bit compression function F makes r calls to a primitive f of n-bit input, then a collision for F can be ...
John P. Steinberger
ICDE
2009
IEEE
114views Database» more  ICDE 2009»
16 years 6 months ago
On Efficient Query Processing of Stream Counts on the Cell Processor
In recent years, the sketch-based technique has been presented as an effective method for counting stream items on processors with limited storage and processing capabilities, such...
Dina Thomas, Rajesh Bordawekar, Charu C. Aggarwal,...
ICDE
2006
IEEE
144views Database» more  ICDE 2006»
16 years 6 months ago
Approximately Processing Multi-granularity Aggregate Queries over Data Streams
Aggregate monitoring over data streams is attracting more and more attention in research community due to its broad potential applications. Existing methods suffer two problems, 1...
Shouke Qin, Weining Qian, Aoying Zhou