{"title":"在直接操作可视化查询环境中处理增量多维范围查询","authors":"S. Hibino, Elke A. Rundensteiner","doi":"10.1109/ICDE.1998.655808","DOIUrl":null,"url":null,"abstract":"We have developed a MultiMedia Visual Information Seeking (MMVIS) Environment designed to support an integrated approach to direct manipulation temporal querying and browsing of temporal relationship results. We address the optimization of queries specified via our visual query interface. Queries in MMVIS are incrementally specified and continuously refined multidimensional range queries. We present our k-Array index structure and its bucket based counterpart, the k-Bucket, as new indexes optimized for processing these direct manipulation queries. In an experimental evaluation comparing our k-Array and k-Bucket solutions to alternate techniques from the literature, we show that the k-Bucket performs generally equal to or better than the other techniques and is the best overall approach for such environments.","PeriodicalId":264926,"journal":{"name":"Proceedings 14th International Conference on Data Engineering","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":"{\"title\":\"Processing incremental multidimensional range queries in a direct manipulation visual query environment\",\"authors\":\"S. Hibino, Elke A. Rundensteiner\",\"doi\":\"10.1109/ICDE.1998.655808\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We have developed a MultiMedia Visual Information Seeking (MMVIS) Environment designed to support an integrated approach to direct manipulation temporal querying and browsing of temporal relationship results. We address the optimization of queries specified via our visual query interface. Queries in MMVIS are incrementally specified and continuously refined multidimensional range queries. We present our k-Array index structure and its bucket based counterpart, the k-Bucket, as new indexes optimized for processing these direct manipulation queries. In an experimental evaluation comparing our k-Array and k-Bucket solutions to alternate techniques from the literature, we show that the k-Bucket performs generally equal to or better than the other techniques and is the best overall approach for such environments.\",\"PeriodicalId\":264926,\"journal\":{\"name\":\"Proceedings 14th International Conference on Data Engineering\",\"volume\":\"25 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-02-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"16\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 14th International Conference on Data Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICDE.1998.655808\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 14th International Conference on Data Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDE.1998.655808","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Processing incremental multidimensional range queries in a direct manipulation visual query environment
We have developed a MultiMedia Visual Information Seeking (MMVIS) Environment designed to support an integrated approach to direct manipulation temporal querying and browsing of temporal relationship results. We address the optimization of queries specified via our visual query interface. Queries in MMVIS are incrementally specified and continuously refined multidimensional range queries. We present our k-Array index structure and its bucket based counterpart, the k-Bucket, as new indexes optimized for processing these direct manipulation queries. In an experimental evaluation comparing our k-Array and k-Bucket solutions to alternate techniques from the literature, we show that the k-Bucket performs generally equal to or better than the other techniques and is the best overall approach for such environments.