The design and analysis of spatial data structures
The design and analysis of spatial data structures
Designing the user interface (2nd ed.): strategies for effective human-computer interaction
Designing the user interface (2nd ed.): strategies for effective human-computer interaction
The dynamic HomeFinder: evaluating dynamic queries in a real-estate information exploration system
SIGIR '92 Proceedings of the 15th annual international ACM SIGIR conference on Research and development in information retrieval
A review of recent work on multi-attribute access methods
ACM SIGMOD Record
Dynamic queries for information exploration: an implementation and evaluation
CHI '92 Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The Grid File: An Adaptable, Symmetric Multikey File Structure
ACM Transactions on Database Systems (TODS)
Multikey retrieval from K-d trees and QUAD-trees
SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
Data Structures for Range Searching
ACM Computing Surveys (CSUR)
Human Factors Studies of Database Query Languages: A Survey and Assessment
ACM Computing Surveys (CSUR)
Multidimensional binary search trees used for associative searching
Communications of the ACM
Multi-attribute retrieval with combined indexes
Communications of the ACM
PDIS '93 Proceedings of the second international conference on Parallel and distributed information systems
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Main Memory Database Systems: An Overview
IEEE Transactions on Knowledge and Data Engineering
MMVIS: design and implementation of a multimedia visual information seeking environment
MULTIMEDIA '96 Proceedings of the fourth ACM international conference on Multimedia
Dynamic information visualization
ACM SIGMOD Record
Dynamic Queries for Visual Information Seeking
IEEE Software
Design and Evaluation of Incremental Data Structures and Algorithms for Dynamic Query Interfaces
INFOVIS '97 Proceedings of the 1997 IEEE Symposium on Information Visualization (InfoVis '97)
An initial study in using audio-visual stimuli in e-commerce
SEPADS'07 Proceedings of the 6th WSEAS International Conference on Software Engineering, Parallel and Distributed Systems
Dynamic query visualisations on World Wide Web clients: a DHTML solution for maps and scattergrams
International Journal of Web Engineering and Technology
Query assistant based on experience capitalization for information retrieval systems
HSI'09 Proceedings of the 2nd conference on Human System Interactions
Hi-index | 0.00 |
Dynamic Queries is a querying technique for doing range search on multi-key data sets. It is a direct manipulation mechanism where the query is formulated using graphical widgets and the results are displayed graphically preferably within 100 milliseconds.This paper evaluates four data structures, the multilist, the grid file, k-d tree and the quad tree used to organize data in high speed storage for dynamic queries. The effect of factors like size, distribution and dimensionality of data on the storage overhead and the speed of search is explored. Analytical models for estimating the storage and the search overheads are presented, and verified to be correct by empirical data. Results indicate that multilists are suitable for small (few thousand points) data sets irrespective of the data distribution. For large data sets the grid files are excellent for uniformly distributed data, and trees are good for skewed data distributions. There was no significant difference in performance between the tree structures.