Sciweavers

736 search results - page 23 / 148
» A dynamic data structure for approximate range searching
Sort
View
CIKM
2009
Springer
14 years 1 months ago
Low-cost management of inverted files for online full-text search
In dynamic environments with frequent content updates, we require online full-text search that scales to large data collections and achieves low search latency. Several recent met...
Giorgos Margaritis, Stergios V. Anastasiadis
SIGMOD
2003
ACM
174views Database» more  SIGMOD 2003»
14 years 9 months ago
ViST: A Dynamic Index Method for Querying XML Data by Tree Structures
With the growing importance of XML in data exchange, much research has been done in providing flexible query facilities to extract data from structured XML documents. In this pape...
Haixun Wang, Sanghyun Park, Wei Fan, Philip S. Yu
CN
2004
148views more  CN 2004»
13 years 8 months ago
Multiway range trees: scalable IP lookup with fast updates
In this paper, we introduce a new IP lookup scheme with worst-case search and update time of O(log n), where n is the number of prefixes in the forwarding table. Our scheme is base...
Priyank Ramesh Warkhede, Subhash Suri, George Varg...
SSD
2005
Springer
185views Database» more  SSD 2005»
14 years 2 months ago
Evaluation of a Dynamic Tree Structure for Indexing Query Regions on Streaming Geospatial Data
Most recent research on querying and managing data streams has concentrated on traditional data models where the data come in the form of tuples or XML data. Complex types of strea...
Quinn Hart, Michael Gertz, Jie Zhang
ICDE
2002
IEEE
206views Database» more  ICDE 2002»
14 years 10 months ago
Exploiting Local Similarity for Indexing Paths in Graph-Structured Data
XML and other semi-structured data may have partially specified or missing schema information, motivating the use of a structural summary which can be automatically computed from ...
Raghav Kaushik, Pradeep Shenoy, Philip Bohannon, E...