44,244 Hits in 21.1 sec

Research on Virtual and Identity Identity, Correlation and Analysis Technology of Internet-related Economic Crimes Based on Big Data

Jing Yuan, Min Tu
2019 Journal of Physics, Conference Series  
Finally, using full-text search technology to achieve target search and virtual identity association analysis under big data.  ...  A large number of virtual identity exchanges form a social network relationship diagram, but the network virtual identity does not require real-name authentication, which increases the security maintenance  ...  Full-text Search Technology At present, the search for structured data is relatively mature and fast, and database data or metadata can be searched by using SQL statements or by using Windows search.  ... 
doi:10.1088/1742-6596/1288/1/012034 fatcat:3g2dlkhrhncrtdbq4v7itmje7e

Large scale document inversion using a multi-threaded computing system

Sungbo Jung, Dar-Jen Chang, Juw Won Park
2017 ACM SIGAPP Applied Computing Review  
Although the inverted index is a useful data structure that can be used for full text searches or document retrieval, a large number of documents will require a tremendous amount of time to create the  ...  This trend has led to a surge of interest in using multi-threaded computing devices, such as the Graphics Processing Unit (GPU), for general purpose computing.  ...  Funding was provided by a grant from the National Institutes of Health (NIH), National Institute for General Medical Science (NIGMS) grant P20GM103436 (Nigel Cooper, PI).  ... 
doi:10.1145/3131080.3131083 pmid:29861701 pmcid:PMC5983369 fatcat:7anbcdkuazhklpo5bvrmy6iksi

Incremental Text Indexing for Fast Disk-Based Search

Giorgos Margaritis, Stergios V. Anastasiadis
2014 ACM Transactions on the Web  
Incremental text indexing for fast disk-based search.  ...  We introduce a greedy method called Selective Range Flush (SRF) to contiguously organize the index over disk blocks and dynamically update it at low cost.  ...  Permission to use the ClueWeb09 Text Research Collections has been granted by Organization Agreement with Carnegie Mellon University.  ... 
doi:10.1145/2560800 fatcat:bdwpapill5g6lawoih67ojljaa

Fragger: a protein fragment picker for structural queries

Francois Berenger, David Simoncini, Arnout Voet, Rojan Shrestha, Kam Y.J. Zhang
2017 F1000Research  
Fragger can efficiently search a fragment database with a query fragment and a distance threshold. Matching fragments are ranked by distance to the query.  ...  PubMed Abstract | Publisher Full Text | Free Full Text 9. Zhang J, Liang Y, Zhang Y, et al.: Atomic-Level Protein Structure Refinement Using Fragment-Guided Molecular Dynamics Conformation Sampling.  ...  RMSDs are computed efficiently via the QCP method 20 .  ... 
doi:10.12688/f1000research.12486.1 pmid:29399321 pmcid:PMC5773926 fatcat:icojzp23xjhdjih5hggiuhcs7q

Low-cost management of inverted files for online full-text search

Giorgos Margaritis, Stergios V. Anastasiadis
2009 Proceeding of the 18th ACM conference on Information and knowledge management - CIKM '09  
Selective Range Flush is a greedy method that we introduce to manage the index in the system by using fixed-size blocks to organize the data on disk and dynamically keep low the cost of data transfer between  ...  In dynamic environments with frequent content updates, we require online full-text search that scales to large data collections and achieves low search latency.  ...  inverted files for online full-text search.  ... 
doi:10.1145/1645953.1646012 dblp:conf/cikm/MargaritisA09 fatcat:qtyfmzdcvnawnm33ksxvsej7wm

String algorithms and data structures [article]

Paolo Ferragina
2008 arXiv   pre-print
The string-matching field has grown at a such complicated stage that various issues come into play when studying it: data structure and algorithmic design, database principles, compression techniques,  ...  The expertise nowadays required to design good string data structures and algorithms is therefore transversal to many computer science fields and much more study on the orchestration of known, or novel  ...  with Mikkel Thorup; finally, the WFMindex (Section 4.3) is a recent advancement achieved together with Giovanni Manzini.  ... 
arXiv:0801.2378v1 fatcat:2subtyqbm5hkpefrsio33ioktm

Algorithms and Data Structures for External Memory

Jeffrey Scott Vitter
2006 Foundations and Trends® in Theoretical Computer Science  
Algorithms and Data Structures for External Memory describes several useful paradigms for the design and implementation of efficient EM algorithms and data structures.  ...  A variety of EM paradigms are considered for solving batched and online problems efficiently in external memory.  ...  range searching into one dynamic data structure for the full problem.  ... 
doi:10.1561/0400000014 fatcat:bkfchugd4fbjvcu5zipnh23k6e

Integrated document management system

Andreas R. Dengel, Nelson M. Mattos, Bernhard Mitschang, Mohan M. Trivedi
1990 Applications of Artificial Intelligence VIII  
The method employed by the interpretation rules is mainly based on a full text search with key words in connection With morphological analysis.  ...  The resulting ASCII-Code is employed to initiate a full text search with keywords in connection with morphological analysis.  ... 
doi:10.1117/12.21085 fatcat:nno3z3ztifejtkbnm4rzuqzwt4

DFG Priority Programme SPP 1736: Algorithms for Big Data

Mahyar Behdju, Ulrich Meyer
2017 Künstliche Intelligenz  
Volume, Velocity, and Variety are the three Vs commonly used to define the term big data.  ...  In this article we give a short overview on the research topics represented within this priority programme.  ...  Bast and her group have developed semantic full-text search, a deep integration of full-text and ontology search.  ... 
doi:10.1007/s13218-017-0518-4 fatcat:6vk5y3servb4bnos4lglbhziki

RapidRead: Step-At-A-Glance Crisis Checklists

Jesse Cirimele, Leslie Wu, Kristen Leach, Stuart Card, T Kyle Harrison, Larry Chu, Scott Klemmer
2014 Proceedings of the 8th International Conference on Pervasive Computing Technologies for Healthcare  
Furthermore, discretionary checklist use is fragmented and bursty rather than predictable and continuous.  ...  It distills three patterns for designing rapidly readable aids: Dynamic Focus, Object-Action, and Information Patches.  ...  Participants were seated in a chair at a fixed distance of approximately 2' from a 22" monitor with a a) Standard Text, b) Structured Text c) Color Block d) Pictographic e) Dynamic Focus Table  ... 
doi:10.4108/icst.pervasivehealth.2014.254954 dblp:conf/ph/CirimeleWLCHCK14 fatcat:oolgvuyz6fhrhee7w5czbwq7le

What, where, and when

Sergey Nepomnyachiy, Bluma Gelley, Wei Jiang, Tehila Minkus
2014 Proceedings of the 8th Workshop on Geographic Information Retrieval - GIR '14  
It exploits the structure of time-stamped data to dramatically shrink the temporal search space and uses a shallow tree based on the spatial distribution of tweets to allow speedy search over the spatial  ...  In the case of Twitter, many tweets are tagged with location information as well as timestamps, creating a demand for query processors that can search both of these dimensions along with text.  ...  Acknowledgements This work was supported in part by the NSF (under grants 0966187 and 0904246) and by GAANN Grant P200A090157 from the US Department of Education.  ... 
doi:10.1145/2675354.2675358 dblp:conf/gir/NepomnyachiyGJM14 fatcat:e7mrj576uvdennsmxajmjq6wh4

The database research group at the Max-Planck Institute for Informatics

Gerhard Weikum
2006 SIGMOD record  
Our new method uses a probabilistic threshold test for fast approximation of top-k results.  ...  We have developed the SphereSearch prototype engine [15] that can search such graph data and rank search results, using a query language that is simpler than XPath Full-Text but much more powerful than  ... 
doi:10.1145/1168092.1168099 fatcat:zbcp54czabflhf5hn6jzz3nc4q

External memory algorithms and data structures: dealing with massive data

Jeffrey Scott Vitter
2001 ACM Computing Surveys  
We consider a variety of EM paradigms for solving batched and online problems efficiently in external memory.  ...  The resulting input/output communication (or I/O) between fast internal memory and slower external memory (such as disks) can be a major performance bottleneck.  ...  Figure 1 is a modified version of a figure by Darren Vengroff, and Figure 2 comes from Cormen et al. [1990] .  ... 
doi:10.1145/384192.384193 fatcat:tunz4fa3rrgv7hwbk7qsvahd5i

Mimir: Term-distributed indexing and search for secret documents

Guoqiang Gao, Ruixuan Li, Xiwu Gu, Kunmei Wen, Zhengding Lu, Kun Yan
2010 Proceedings of the 6th International ICST Conference on Collaborative Computing: Networking, Applications, Worksharing  
Mimir uses dynamic pipelined search strategy to balance the load of the management server and reduce the search delay.  ...  Mimir constructs the distributed indexes based on load balanced term distribution for better search efficiency and load balanced query.  ...  It uses dynamic pipe lined search strategy to balance the load of the management server and reduce the search delay. Our (a) Query response time � 800 r--r--r--r--r--r--r--r--r--r-.  ... 
doi:10.4108/icst.collaboratecom.2010.25 dblp:conf/colcom/GaoLGWLY10 fatcat:ed64l7uesrcsni3rmmc63kqfra

Redesigning the string hash table, burst trie, and BST to exploit cache

Nikolas Askitis, Justin Zobel
2010 ACM Journal of Experimental Algorithmics  
These data structures are computationally efficient, but typical implementations use large numbers of nodes and pointers to manage strings, which is not efficient in use of cache.  ...  The most efficient current data structures for this task are the hash table with move-to-front chains and the burst trie, both of which use linked lists as a substructure, and variants of binary search  ...  INTRODUCTION Simple in-memory data structures are basic building blocks of programming, and are used to manage temporary data in scales ranging from a few items to gigabytes.  ... 
doi:10.1145/1671970.1921704 fatcat:eimxbg3zvjcpfefwa7jr7wx76i
« Previous Showing results 1 — 15 out of 44,244 results