Sciweavers

1992 search results - page 5 / 399
» Implementing sorting in database systems
Sort
View
VLDB
1997
ACM
126views Database» more  VLDB 1997»
13 years 11 months ago
Dynamic Memory Adjustment for External Mergesort
Sorting is a memory intensive operation whose performance is greatly affected by the amount of memory available as work space. When the input size is unknown or available memory s...
Weiye Zhang, Per-Åke Larson
WEBI
2001
Springer
14 years 18 hour ago
A Rough Set-Aided System for Sorting WWW Bookmarks
Most people store ‘bookmarks’ to web pages. These allow the user to return to a web page later on, without having to remember the exact URL address. People attempt to organise ...
Richard Jensen, Qiang Shen
CIDR
2003
147views Algorithms» more  CIDR 2003»
13 years 9 months ago
Sorting And Indexing With Partitioned B-Trees
Partitioning within a B-tree, based on an artificial leading key column and combined with online reorganization, can be exploited during external merge sort for accurate deep read...
Goetz Graefe
WSC
1997
13 years 9 months ago
Using a Simulation Model to Evaluate the Configuration of a Sortation Facility
At a parcel delivery company, the items being shipped must be sorted by destination. However, the company typically serves more destinations than there are distinct positions for ...
Dale Masel, David Goldsmith
VLDB
2005
ACM
122views Database» more  VLDB 2005»
14 years 1 months ago
Optimizing Nested Queries with Parameter Sort Orders
Nested iteration is an important technique for query evaluation. It is the default way of executing nested subqueries in SQL. Although decorrelation often results in cheaper non-n...
Ravindra Guravannavar, H. S. Ramanujam, S. Sudarsh...