Matches in SemOpenAlex for { <https://semopenalex.org/work/W1548508109> ?p ?o ?g. }
Showing items 1 to 69 of
69
with 100 items per page.
- W1548508109 abstract "This thesis investigates problems arising on tree structures that model scenarios involving large data sets in wireless, distributed, and parallel environments. The problems include efficient client and server algorithms for broadcasting and query processing on a multi-dimensional indexed data set, improving the performance of external searching in static trees, and developing new tree-based clustering heuristics tailored towards structural properties. In a wireless mobile environment, the broadcast of data together with an index structure allows a mobile client to tune selectively into the broadcast to obtain desired data and therefore reduces tuning time (i.e., time spent on listening to the broadcast). This thesis investigates query execution on broadcasted multi-dimensional index structures. The solutions minimize the tuning time and latency and efficiently handle the query execution starting at an arbitrary time. The proposed protocols differ in the broadcast schedule format, in how a client manages the information with limited memory, and in the data structures employed by a client. Experimental work on real and synthetic data shows these different protocols lead to different latencies and tuning times. Solutions presented for a multiple channel environment achieve optimal cycle length. This thesis also considers the use of data replication to improve external searching in static tree structures. Efficient mappings from the nodes of a tree to blocks when nodes can be replicated are presented. The amount of node replication is controlled and block utilization and blocknumber are optimized. The results show that, by increasing the total space by at most a factor of 1.5, one can achieve a blocknumber proportional to the optimal blocknumber. The result also shows that when each node can be replicated a constant number of times, no significant reduction in the blocknumber may be possible. Tree clustering partitions the nodes of a tree into disjoint sets, called clusters, subject to balancing the number of nodes and minimizing the number of subtrees in each cluster. We show that such a clustering problem is NP-complete." @default.
- W1548508109 created "2016-06-24" @default.
- W1548508109 creator A5008534258 @default.
- W1548508109 creator A5008726968 @default.
- W1548508109 date "2002-01-01" @default.
- W1548508109 modified "2023-09-28" @default.
- W1548508109 title "Broadcasting and blocking large data sets with an index tree" @default.
- W1548508109 hasPublicationYear "2002" @default.
- W1548508109 type Work @default.
- W1548508109 sameAs 1548508109 @default.
- W1548508109 citedByCount "2" @default.
- W1548508109 crossrefType "journal-article" @default.
- W1548508109 hasAuthorship W1548508109A5008534258 @default.
- W1548508109 hasAuthorship W1548508109A5008726968 @default.
- W1548508109 hasConcept C105795698 @default.
- W1548508109 hasConcept C110157686 @default.
- W1548508109 hasConcept C113174947 @default.
- W1548508109 hasConcept C120314980 @default.
- W1548508109 hasConcept C12590798 @default.
- W1548508109 hasConcept C134306372 @default.
- W1548508109 hasConcept C2524010 @default.
- W1548508109 hasConcept C2777210771 @default.
- W1548508109 hasConcept C31258907 @default.
- W1548508109 hasConcept C33923547 @default.
- W1548508109 hasConcept C41008148 @default.
- W1548508109 hasConcept C76155785 @default.
- W1548508109 hasConcept C82876162 @default.
- W1548508109 hasConcept C943373 @default.
- W1548508109 hasConceptScore W1548508109C105795698 @default.
- W1548508109 hasConceptScore W1548508109C110157686 @default.
- W1548508109 hasConceptScore W1548508109C113174947 @default.
- W1548508109 hasConceptScore W1548508109C120314980 @default.
- W1548508109 hasConceptScore W1548508109C12590798 @default.
- W1548508109 hasConceptScore W1548508109C134306372 @default.
- W1548508109 hasConceptScore W1548508109C2524010 @default.
- W1548508109 hasConceptScore W1548508109C2777210771 @default.
- W1548508109 hasConceptScore W1548508109C31258907 @default.
- W1548508109 hasConceptScore W1548508109C33923547 @default.
- W1548508109 hasConceptScore W1548508109C41008148 @default.
- W1548508109 hasConceptScore W1548508109C76155785 @default.
- W1548508109 hasConceptScore W1548508109C82876162 @default.
- W1548508109 hasConceptScore W1548508109C943373 @default.
- W1548508109 hasLocation W15485081091 @default.
- W1548508109 hasOpenAccess W1548508109 @default.
- W1548508109 hasPrimaryLocation W15485081091 @default.
- W1548508109 hasRelatedWork W1525092603 @default.
- W1548508109 hasRelatedWork W2011230078 @default.
- W1548508109 hasRelatedWork W2019114898 @default.
- W1548508109 hasRelatedWork W2096749370 @default.
- W1548508109 hasRelatedWork W2097802606 @default.
- W1548508109 hasRelatedWork W2104740463 @default.
- W1548508109 hasRelatedWork W2109464511 @default.
- W1548508109 hasRelatedWork W2113766208 @default.
- W1548508109 hasRelatedWork W2140701158 @default.
- W1548508109 hasRelatedWork W2140869148 @default.
- W1548508109 hasRelatedWork W2152143040 @default.
- W1548508109 hasRelatedWork W2171155931 @default.
- W1548508109 hasRelatedWork W2370361266 @default.
- W1548508109 hasRelatedWork W2395019391 @default.
- W1548508109 hasRelatedWork W2529787296 @default.
- W1548508109 hasRelatedWork W2741091914 @default.
- W1548508109 hasRelatedWork W2864044723 @default.
- W1548508109 hasRelatedWork W2887271722 @default.
- W1548508109 hasRelatedWork W2963815030 @default.
- W1548508109 hasRelatedWork W41538315 @default.
- W1548508109 isParatext "false" @default.
- W1548508109 isRetracted "false" @default.
- W1548508109 magId "1548508109" @default.
- W1548508109 workType "article" @default.