Sciweavers

1623 search results - page 89 / 325
» No Sorting
Sort
View
IPL
2002
125views more  IPL 2002»
15 years 4 months ago
A note concerning the closest point pair algorithm
An algorithm, described by Sedgewick, finds the distance between the closest pair of n given points in a plane using a variant of mergesort. This takes O(n log n) time. To prove t...
Martin Richards
MST
2002
128views more  MST 2002»
15 years 3 months ago
A Simple and Efficient Parallel Disk Mergesort
External sorting--the process of sorting a file that is too large to fit into the computer's internal memory and must be stored externally on disks--is a fundamental subroutin...
Rakesh D. Barve, Jeffrey Scott Vitter
ICDE
2008
IEEE
163views Database» more  ICDE 2008»
16 years 5 months ago
Approximate Joins for Data-Centric XML
In data integration applications, a join matches elements that are common to two data sources. Often, however, elements are represented slightly different in each source, so an app...
Nikolaus Augsten, Michael H. Böhlen, Curtis E...
SIGMOD
2009
ACM
157views Database» more  SIGMOD 2009»
16 years 4 months ago
Authenticated join processing in outsourced databases
Database outsourcing requires that a query server constructs a proof of result correctness, which can be verified by the client using the data owner's signature. Previous aut...
Yin Yang, Dimitris Papadias, Stavros Papadopoulos,...
WCRE
2007
IEEE
15 years 10 months ago
Documenting Typical Crosscutting Concerns
Our analysis of crosscutting concerns in real-life software systems (totaling over 500,000 LOC) and in reports from literature indicated a number of properties that allow for thei...
Marius Marin, Leon Moonen, Arie van Deursen